Binary search is O(log n), but that's not the whole story

Everyone learns binary search as the textbook example of O(log n) efficiency. Halve the search space,...