Which one of the following in place sorting algorithms needs the minimum number of swaps ?

Which one of the following in place sorting algorithms needs the minimum number of swaps ?

A) Quick Sort.
B) Insertion sort.
C) Heap Sort.
D) Selection sort.

Answer & Solution

Answer: Option D
Solution:
Selection sort.