Algorithm 1 SelectionSort
1:function FindMin(A, b, n)
2:minInd←b
3:for i←b+1 to n−1 do
4:if A[i]<A[minInd] then
5:minInd←i
6:end if
7:end for
8:return minInd
9:end function
10:procedure SelectionSort(A,n)
11:for i←0 to n−2 do
12:j← FindMin(A, i, n)
13:swap(A[i], A[j])
14:end for
15:end procedure