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

Question

Quizplus · Accepted Answer

Binary search is more efficient than linear search because binary search has a time complexity of O(log n) while linear search has a time complexity of O(n). This means that as the size of the input gets larger, the binary search algorithm will take less time to execute compared to the linear search algorithm.

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

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