What is the worst case complexity of binary search using recursion?
O(nlogn)
O(logn)
O(n)
O(n^{2})
(B) O(logn)
Explanation:
Using the divide and conquer master theorem.
