Which one of the following in-place sorting algorithms needs the minimum number of swaps?
(A) Insertion Sort
(B) Quick Sort
(C) Heap Sort
(D) Selection Sort
Explanation: Selection Sort is an in-place algorithm having minimum number of swaps. It works on greedy approach and takes O(n) swaps to sort the array of n elements.
Refer: GATE-CS-2006 | Question 14
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.