Look at the middle element, decide which half can still contain the answer, and repeat. 1000 items need at most about 10 steps. git bisect applies it to commit history.
Binary search
A search that discards half of the remaining range at every step, in O(log n).