Algorithm 3 Selection-Sort(A[1..n]A[1..n]A[1..n])
1:for i=1i = 1i=1 to n−1n - 1n−1 do
2:min=imin = imin=i
3:for j=i+1j = i + 1j=i+1 to nnn do
4: // Find the index of ithi^{th}ith smallest element
5:if A[j] < A[min] then
6:min=jmin = jmin=j
7:end if
8:end for
9:Swap(A[i],A[min]A[i], A[min]A[i],A[min])
10:end for