Computer Science · Divide and Conquer Complexity
Which of the following is the correct recurrence relation for the worst-case time complexity of Binary Search?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1T(n) = 2T(n/2) + O(1), with T(1) = T(0) = O(1)
- 2T(n) = T(n/2) + O(n), with T(1) = T(0) = O(1)
- 3T(n) = T(n/2) + O(1), with T(1) = T(0) = O(1)✓
- 4T(n) = T(n/2) + O(log n), with T(1) = T(0) = O(1)
Correct answer
T(n) = T(n/2) + O(1), with T(1) = T(0) = O(1)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Divide and Conquer Complexity MCQs →Want more practice questions on Divide and Conquer Complexity?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Divide and Conquer Complexity