What is the average case time complexity of binary search using recursion?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer:B
What is the average case time complexity of binary search using recursion?
A. O(nlogn) B. O(logn) C. O(n) D. O(n2)
Explanation: T(n) = T(n/2) + 1, Using the divide and conquer master theorem.