Question

What is the best case time complexity for linear search?

• A. \(O(n \log n)\)
• B. \(O(\log n)\)
• C. \(O(n)\)
• D. \(O(1)\)

Hint:

Best case for linear search is when the target is first element — only one check needed.

Answer 1

The Correct Option is D

In the best case, the element is found at the first index in linear search. So only one comparison is required ⇒ constant time.