A binary search eliminates half of the viable candidates with each comparison.

Question

Quizplus · Accepted Answer

a binary search does eliminate half of the viable candidates with each comparison. This is because it operates by dividing the search space in half each time. It starts by comparing the target value to the middle element of the array. If the target value is greater, it knows it can eliminate the lower half of the array, and vice versa. This process continues, halving the search space each time, until the target value is found or until the search space is reduced to zero. This makes binary search a very efficient algorithm, especially for large data sets, as it has a time complexity of O(log n).

A Binary Search Eliminates Half of the Viable Candidates with Each