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

A

Quick-sort

B

insertion sort

C

Selection sort

D

Heap sort