Sail E0 Webinar
Question
What is the time complexity of the above recursive implementation of binary search?
Options:
A .  O(n)
B .  O(2n)
C .  O(logn)
D .  O(n!)
Answer: Option C


The time complexity of the above recursive implementation of binary search is O(logn).



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers