Question:

Which search method has logarithmic complexity?

Show Hint

Binary Search requires the data to be sorted before searching.
Updated On: Jun 8, 2026
  • Linear Search
  • Binary Search
  • Sequential Search
  • Traversal
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

Concept: Time complexity measures the number of operations required by an algorithm as the size of input increases.

Step 1:
Recall complexities \[ \text{Linear Search} = O(n) \] \[ \text{Binary Search} = O(\log n) \]

Step 2:
Identify logarithmic search Binary search repeatedly divides the search space into two halves, reducing the number of comparisons significantly. Final Answer: \[ \boxed{\text{Binary Search}} \]
Was this answer helpful?
0
0