ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the worst case complexity of binary search using recursion?
O(nlogn)
O(logn)
O(n)
O(n^{2})
Correct Answer: B — O(logn)
Using the divide and conquer master theorem.
