A(n)________search is more efficient than a(n)________search.
A)integer, double
B)string, double
C)binary, linear
D)linear, binary
E)None of the above. All searches are equally efficient.

Question

Quizplus · Accepted Answer

A binary search is more efficient than a linear search because it divides the search interval in half each time, reducing the time complexity to O(log n), whereas a linear search checks each element one by one, resulting in a time complexity of O(n).

A(n)________search Is More Efficient Than A(n)________search

A(n)search Is More Efficient Than A(n)search