The complexity of linear search algorithm is:

2017

Answer: B. O(n) — Linear search checks elements one by one .

1. A.

   O(n log n)

2. B.

   O(n)

3. C.

   O(log n)

4. D.

   O(n²)

Attempted by 1338 students.