每次选择剩余得数字中最小得数字排到剩余数字得第一位。
def SelectionSort(A, n):
for i in range(n-1):
k = i;
for j in range(i+1,n):
if(A[k]>A[j]):
k = j;
A[i], A[k] = swap(A[i], A[k]);
print(A);
def swap(a, b):
return b, a;