Selection sort

for (i=0; i<= n-2; i++){ find the smallest element a[j] in a[i],...,a[n-1]; swap(a,i,j);}

for (i=0; i<= n-2; i++){ find the smallest element a[j] in a[i],...,a[n-1]; swap(a,i,j); }