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

Question

Jocelynn Hensley

Computers & Technology

10 August, 20:35

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

+2

Answers (1)

Know the Answer?

Juan Wilkins · Answer 1

(B) will cut the portion of the array being searched in half each time the loop fails to locate the search value.

Explanation:

The binary search algorithm is a divide and conquer algorithm. It each divides the array in half when it is unsuccessful in finding the answer. It is more efficient than sequential search algorithm. The pre-requisite for binary search to implement is the array should be sorted either in increasing or decreasing order. You can code for array sorted in increasing and decreasing order.