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