A(n)________ search is more efficient than a ________ search.
A)character, string
B)integer, double
C)binary, linear
D)linear, binary
E)None of these

Question

Quizplus · Accepted Answer

A binary search is more efficient than a linear search because it utilizes the divide-and-conquer strategy and reduces the search interval by half with each comparison, resulting in a logarithmic time complexity. In contrast, a linear search examines every element in the list, resulting in a linear time complexity.

A(n)________ Search Is More Efficient Than a ________ Search

A(n) Search Is More Efficient Than a Search