1. Computer Science Engineering (CSE)
  2. Data Structures (DS)
  3. Searching, Sorting and Hashing Technique...
  4. What is the best case and worst case com...
Q.

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)
Answer» D. O(1), O(n)
View all MCQs in:   Data Structures (DS)

Discussion