Algorithm For Selection Sort

1. n<-length br="">2. For j<-1 br="" n-1="" to="">3. smallest<-j br="">4. For i<-j br="" n="" to="">5. if A[i]6. then smallest <-i br="">7. exchange(A[j],A[smallest])