Binary search: the invariant that makes it work

At every step, the target—if present—remains inside the current search interval. Comparing the midpoint lets us discard half the interval without breaking that invariant. The logarithmic running time comes from repeatedly halving the remaining candidates, not from the syntax of the loop.