Binary search

If you have a sorted list, search for an element in the list by starting in the middle. If the match fails, discard the half of the list that’s too high (or too low), and then repeat the process until the element is found.

Getting this exactly right has some subtleties.

The Five Most Important Algorithms, Daniel Lemire.