Q.

What is the worst case for linear search?

A. O(nlogn)
B. O(logn)
C. O(n)
D. O(1)
Answer» C. O(n)
2k
0
Do you find this helpful?
1

View all MCQs in

Data Structures (DS)

Discussion

No comments yet