Binary Search (and Searching the Answer)

Halve the search space every step: find items in sorted arrays in O(log n), find boundaries, and even binary-search an answer. Finding a boundary Many problems ask for the first position where something becomes true (first bad version, first number ≥ x). Keep the answer and keep searching left: Binary search on the answer "Koko eats bananas": piles of bananas, h hours. What is the slowest eating speed that finishes…