binary search

bs.rb

# Best O(1)
# Worst O(long n)

arr = [1,2,3,4,5,6,7,10]


def bs (list, elem)
  low = 0
  high = list.length
  
  while low != high
    mid = (low + high) / 2
    if elem == list[mid]
      puts "Find elem and its number in array #{mid} and equal #{list[mid]}"
      return mid
    elsif elem < list[mid]
      high = mid
    else
      low = mid + 1
    end
  end
  return -1
end

puts bs(arr, 5)