Binary Search

• Assume n is a power of 2,    n = 2^m
  where m = log₂(n)
• Then:    T(n) = 1 + log₂(n)
• Binary search is an O(log(n)) algorithm