Binary search requires that the list it searches is first:

1. Each comparison discards half the list. 2. That only works if order is known. 3. So the list must be sorted. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._