Computer Science · Data Structures and Algorithms
निम्नलिखित में से किस सॉर्टिंग एल्गोरिथम की वर्स्ट-केस समय जटिलता (worst-case time complexity) सबसे कम है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1सिलेक्शन सॉर्ट (Selection sort)
- 2क्विक सॉर्ट (Quick sort)
- 3बबल सॉर्ट (Bubble sort)
- 4मर्ज सॉर्ट (Merge sort)✓
सही उत्तर देखें
मर्ज सॉर्ट (Merge 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
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 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