McqMate
| 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) | |
View all MCQs in
Data Structures (DS)No comments yet