Give a practical example in which you would not use Exchange Sort (Algorithm 1.3) to do a sorting task.

 

Algorithm 1.3 Exchange Sort Problem: Sort n keys in nondecreasing order. Inputs: positive integer n, array of keys S' indexed from 1 to n. Outputs: the array S containing the keys in nondecreasing order. void { exchangesort (int n, keytype S[]) index i, j; for (i=1;i