Top | MCQs on Binary Search Algorithm with Answers | Question 8
Last Updated :
Discuss
Comments
Which of the following is correct recurrence for worst case of Binary Search?
T(n) = 2T(n/2) + O(1) and T(1) = T(0) = O(1)
T(n) = T(n-1) + O(1) and T(1) = T(0) = O(1)
T(n) = T(n/2) + O(1) and T(1) = T(0) = O(1)
T(n) = T(n-2) + O(1) and T(1) = T(0) = O(1)
This question is part of this quiz :
Top MCQs on Binary Search Algorithm with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy