binary search

binary_search.rb

def binary_search(arr, element)
  arr.sort!
  i = 0
  j = arr.length - 1

  puts binary(arr, i, j, element)
end

def binary(arr, i, j, element)
  mid = (i + j) / 2

  if element < arr[mid]
    return binary(arr, i, mid - 1, element)
  elsif element > arr[mid]
    return binary(arr, mid + 1, j, element)
  else
    return mid
  end
end