Learning Algorithms
Binary Search
Binary search is an efficient algorithm for finding a target value in a sorted array by repeatedly dividing the search range in half.
n = number of items
g = number of guesses
// The following are the same:
log2(n) = g
log(n) / log(2) = g
ln(n) / ln(2) = g