Algorithm ・In iteration i, find index min of smallest remaining entry. ・Swap a[i] and a[min].Complexity: Running time insensitive to input: Quadratic time, even if input is sorted. Data movement is minimal: Linear number of exchanges.
Processed:
0.041, SQL:
9
