Which one of the following in place sorting algorithms needs the minimum number of swaps?
(A)
Quick sort
(B)
Insertion sort
(C)
Selection sort
(D)
Heap sort
Answer: (C)
Explanation:
Selection sort takes minimum number of swaps to sort an array. It takes maximum of O(n) comparisons to sort an array with n elements.
Hence Selection sort is the answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Article Tags :
Recommended Articles