Question

The most efficient search algorithm is ______.

Options

• Binary search

• Reverse search

• Linear search

• Pointer search

Answer 1

The most efficient search algorithm is Binary search.

Explanation:

Binary search works on a sorted list by comparing the target with the middle element and then discarding half the list each step, so the search space halves each time. Its time complexity is O(log n), which is much faster than linear search’s O(n).