The Binary Search Algorithm

Multiple Choice

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 the loop 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 have an average of N/2 comparisons, where N is the number of elements in the array