Question
What is the average case time complexity of binary search using recursion?
Answer: Option B
Was this answer helpful ?
T(n) = T(n/2) + 1, Using the divide and conquer master theorem.
Was this answer helpful ?
More Questions on This Topic :
Question 2. Select the code snippet for Jump Search. ....
Question 7. How can Jump Search be improved?
....
Submit Solution