Sail E0 Webinar
Question
What is the average case time complexity of binary search using recursion?
Options:
A .  O(nlogn)
B .  O(logn)
C .  O(n)
D .  O(n2)
Answer: Option B


T(n) = T(n/2) + 1, Using the divide and conquer master theorem.



Was this answer helpful ?
Next Question

Submit Solution

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

Latest Videos

Latest Test Papers