McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Data Structure and Algorithms (DSA)
→
The complexity of linear search algorith...
Q.
The complexity of linear search algorithm is
A.
o(n)
B.
o(log n)
C.
o(n2)
D.
o(n log n)
Answer» A. o(n)
2.5k
0
Do you find this helpful?
13
View all MCQs in
Data Structure and Algorithms (DSA)
Discussion
No comments yet
Login to comment
Related MCQs
The complexity of Binary search algorithm is
The complexity of Binary search algorithm is
The Average case occur in linear search algorithm
The time complexity of binary search is O(logn).
The complexity of the average case of an algorithm is
The complexity of Bubble sort algorithm is
The complexity of the average case of an algorithm is
The complexity of Bubble sort algorithm is
The complexity of merge sort algorithm is
A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
