Computer Science · Algorithms
n तत्वों के सॉर्ट किए गए एरे पर बाइनरी सर्च (binary search) में, आवश्यक तुलनाओं की सबसे खराब स्थिति में संख्या क्या होगी?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(1)
- 2O(n log n)
- 3O(log n)✓
- 4O(n)
सही उत्तर देखें
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 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