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) |
Login to Continue
It will take less than 2 minutes