

MCQOPTIONS
Saved Bookmarks
1. |
What is the time complexity of the above recursive implementation of binary search? |
A. | O(n) |
B. | O(2n) |
C. | O(logn) |
D. | O(n!) |
Answer» D. O(n!) | |