Question

CS_MCQ
Best or ideal case complexity for a linear search algorithm is ______.
a) O(log n)
b) O(n)
c) O(1)
d) O(n log n)

Answer 1

Answer:

a . O ( log n )

Explanation:

Answer: a

Explanation: The worst case complexity of linear search is O(n).