Each unsuccessful comparison in binary search reduces the remaining elements by:

1. Discarding one side removes about half the candidates. 2. That is what gives the technique its name. 3. Each unsuccessful comparison reduces the elements remaining to be searched by half. 4. So the answer is half. _Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_