McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2026
→
Computer Science Engineering (CSE)
→
Data Structure and Algorithms (DSA)
→
The complexity of Binary search algorith...
Q.
The complexity of Binary search algorithm is
A.
o(n)
B.
o(log n)
C.
o(n2)
D.
o(n log n)
Answer» B. o(log n)
2.9k
0
Do you find this helpful?
32
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 time complexity of binary search is O(logn).
The complexity of linear search algorithm is
When converting binary tree into extended binary tree, all the original nodes in binary tree are
A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
Binary search algorithm cannot be applied to
Which of the following is not the required condition for binary search algorithm
Which of the following is not a limitation of binary search algorithm ?
The complexity of the average case of an algorithm is
The complexity of Bubble sort algorithm is
