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