Because we eliminate at least __________ of the elements from consideration with each recursive call, binary search is an O(log n) algorithm.
A) one-fifth
B) one-quarter
C) one-third
D) one-half

Question

Quizplus · Accepted Answer

Binary search eliminates one-half of the elements from consideration with each recursive call by comparing the target value to the middle element of the array and then deciding to continue the search in the left or right half, hence it is an O(log n) algorithm.

Because We Eliminate at Least __________ of the Elements from Consideration