Q.

What is the worst case complexity of binary search using recursion?

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

View all MCQs in

Data Structures (DS)

Discussion

No comments yet