Linear search is highly inefficient compared to binary search when dealing with:
A) Small, unsorted arrays.
B) Small, sorted arrays.
C) Large, unsorted arrays.
D) Large, sorted arrays.

Question

Quizplus · Accepted Answer

Binary search is more efficient than linear search for large, sorted arrays because it reduces the search space by half with each step, whereas linear search checks each element one by one.

Linear Search Is Highly Inefficient Compared to Binary Search When