Computer Science · Design and Analysis of Algorithms
निम्नलिखित एल्गोरिदम को उनकी सबसे खराब स्थिति समय जटिलता (worst-case time complexity) के बढ़ते क्रम (सबसे तेज/कम वृद्धि से सबसे धीमी/उच्च वृद्धि) में व्यवस्थित कीजिए: मर्ज सॉर्ट, बबल सॉर्ट, बाइनरी सर्च, लीनियर सर्च
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Linear Search → Bubble Sort → Binary Search → Merge Sort
- 2Binary Search → Linear Search → Merge Sort → Bubble Sort✓
- 3Bubble Sort → Binary Search → Linear Search → Merge Sort
- 4Merge Sort → Bubble Sort → Binary Search → Linear Search
सही उत्तर देखें
Binary Search → Linear Search → Merge Sort → Bubble 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 Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms