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?
- A.
O(nlogn), O(logn)
- B.
O(logn), O(nlogn)
- C.
O(n), O(1)
- D.
O(1), O(n)
Attempted by 276 students.
Sign up free to check your answer
Sign up freeLoading lesson…

