McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2025
→
Computer Science Engineering (CSE)
→
Data Structures (DS)
→
Searching, Sorting and Hashing Technique...
→
What is the worst case for linear search...
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
Login to comment
Related MCQs
What is the best case and worst case complexity of ordered linear search?
In linear search algorithm the Worst case occurs when ____________.
The Worst case occur in linear search algorithm when_____________.
What are the worst case and average case complexities of a binary search tree?
The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
What is the worst case complexity of binary search using recursion?
What is the best case for linear search?
What is the worst case time complexity of inserting a node in a doubly linked list?
The worst case complexity of deleting any arbitrary node value element from heap is
What is the worst case complexity of bubble sort?