Chapter 10 · Lesson 2 of 5

02. Binary search

On a sorted array, check the middle and throw away the half that can't hold the value. Each step halves what's left: far fewer checks.