def selectionsort(A):
for i in range(len(A)):
#print i,#
k=i
#print A[i+1:len(A)],#
for j in range(i+1,len(A)):
if A[j]<A[k]:
k=j
if k!=i:
t=A[i]
A[i]=A[k]
A[k]=t
#print A #
print A
a=[32,12,24,23,13,10,11]
selectionsort(a)
algorithm_selectionsort
最新推荐文章于 2024-09-05 19:42:49 发布