Computer Science · Data Structures and Algorithms
A sorting algorithm works on the following principle: 'Find the smallest item in the list, and exchange it with the left-most unsorted element. Repeat the process from the next unsorted element.' Which sorting algorithm does this correspond to?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Quick Sort
- 2Merge Sort
- 3Selection Sort✓
- 4Insertion Sort
Correct answer
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
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