Binary Search

“A search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.” (related: debugging)

Gabriel Weinberg's Mental Models I Find Repeatedly Useful