Computer Science · Algorithms and Data Structures
Which of the following statements is correct about the divide-and-conquer approach of the binary search technique?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The average-case time complexity of binary search is O(n).
- 2The recurrence relation of binary search is written as T(n) = 2T(n / 2) + O(1).
- 3The worst-case time complexity of binary search is O(log n).✓
- 4The best-case time complexity of binary search is O(log n).
Correct answer
The worst-case time complexity of binary search is O(log n).
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
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms and Data Structures MCQs →Want more practice questions on Algorithms and Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms and Data Structures