The binary search algorithm __________.
A) is less efficient than the sequential search algorithm
B) will cut the portion of the array being searched in half each time it fails to locate the search value
C) will have a maximum number of comparisons equal to the number of elements in the array
D) will, normally, have the number of comparisons that is half the number of elements in the array

Question

Quizplus · Accepted Answer

Binary search algorithm efficiently reduces the search area by half after each comparison, making it more efficient than sequential search for sorted arrays. It does not guarantee a maximum number of comparisons equal to the number of elements, nor does it average half the number of elements for comparisons.

The Binary Search Algorithm __________