Physics · Algorithms
निम्नलिखित सॉर्टिंग एल्गोरिदम में से किसकी वर्स्ट-केस (worst-case) समय जटिलता सबसे कम है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1क्विक सॉर्ट (Quick Sort)
- 2मर्ज सॉर्ट (Merge Sort)✓
- 3बबल सॉर्ट (Bubble Sort)
- 4सिलेक्शन सॉर्ट (Selection 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
Start Free Mock Test →Preparing for Physics?
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 Physics · Algorithms