Gate CS-2006 Question Paper With Solutions

Q. 6 Which one 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: