Computer Science · Algorithms
In a binary search on a sorted array of n elements, the worst-case number of comparisons required is:
Verified Solution4 Options
Loading page...
Computer Science · Algorithms
Correct answer
O(log n)
Save this question and verified answer as a clean study sheet with live clickable link.
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Recommended practice questions in Computer Science · Algorithms
Practice chapter-wise previous year questions (PYQs) with verified step-by-step solutions.
Browse All Questions →