Computer Science · Algorithms
पहले से सॉर्ट किए गए एरे (already sorted array) के दिए जाने पर बबल सॉर्ट (Bubble Sort) एल्गोरिदम की बेस्ट-केस टाइम कॉम्प्लेक्सिटी (best-case time complexity) क्या होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(log n)
- 2O(n)✓
- 3O(n log n)
- 4O(n2)
सही उत्तर देखें
O(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