The binary search is faster than the linear search, providing
A) the size of the array is a power of two.
B) the elements of the array are ordered.
C) the elements of the array are unordered.
D) the element being searched for is actually in the array.

Question

Quizplus · Accepted Answer

Binary search is faster than linear search when the elements of the array are ordered, as it relies on the ability to divide the search interval in half repeatedly.

The Binary Search Is Faster Than the Linear Search, Providing