What is the worst-case time complexity of the linear search algorithm for an…

Bihar STET · PGT (Paper 2) · Computer Science · 2024

1. A.

   O(log n)

2. B.

   O(n)

3. C.

   O(n^2)

4. D.

   O(1)

Attempted by 25 students.

The worked solution is available to enrolled students.