In binary search, the key is first compared with the element in the:

1. Binary search does not start at either end. 2. It starts where it can discard the most. 3. In binary search, the key is compared with the element in the middle of a sorted list. 4. So the answer is the middle. _Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_