Question

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

• A. Quicksort
• B. Insertion sort
• C. Selection sort
• D. Heap sort

Answer 1

The correct option is C Selection sort

In selection sort, minimum number of swaps taken compared to other sorting techniques.
Number of swaps = O(n)
Number of comparisons = $O\left(n^2\right)$
In finds the minimum of the subarray and exchanges only once in every pass.