McqMate
Q. |
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» C. o(logn) | |
Explanation: the time complexity of the above recursive implementation of binary search is o(logn). |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet