What is the best case and worst case complexity of ordered linear search?

PYQ Cognizant GenC 2025

What is the best case and worst case complexity of ordered linear search?

  1. A.

    O(nlogn), O(logn)

  2. B.

    O(logn), O(nlogn)

  3. C.

    O(n), O(1)

  4. D.

    O(1), O(n)

Attempted by 276 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…