Computer Science · Algorithms
Which of the following statements about Binary Search is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Binary Search has a worst-case time complexity of O(n2)
- 2Binary Search can be used directly on any array, whether sorted or unsorted
- 3Binary Search compares the middle element first and then searches in the appropriate half✓
- 4Binary Search always searches every element in the array sequentially
Correct answer
Binary Search compares the middle element first and then searches in the appropriate half
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 MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms