Computer Science · Data Structures and Algorithms
औसत समय जटिलता (average time complexity) O(n log n) होने के कारण बड़े डेटासेट के लिए आमतौर पर कौन सा सॉर्टिंग एल्गोरिदम कुशल माना जाता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1इंसर्शन सॉर्ट (Insertion Sort)
- 2बबल सॉर्ट (Bubble Sort)
- 3क्विक सॉर्ट (Quick Sort)✓
- 4सिलेक्शन सॉर्ट (Selection Sort)
सही उत्तर देखें
क्विक सॉर्ट (Quick Sort)
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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms