Binary Search

On a sorted list, binary search checks the middle, throws away the half that can’t contain the target, and repeats — finding anything in a million items in about 20 steps. Guess the number I’m thinking of a number from 1 to 100. You guess 50 — “higher”. 75 — “lower”. 62… Each guess halves the possibilities. That’s binary search! Check your understanding