Computer Science · Algorithms
N आकार के सॉर्ट किए गए ऐरे पर बाइनरी सर्च एल्गोरिथ्म की सबसे खराब स्थिति (worst-case) समय जटिलता क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(N 2 )
- 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
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 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