class SelectionSort:
def selectionSort(self, A, n):
for i in range(0,n):
min = A[i]
num = i
for j in range(i+1,n):
if min>A[j]:
min=A[j]
num = j
if num!=i:
A[i],A[num]=A[num],A[i]
return A
s=SelectionSort()
print s.selectionSort([54,35,48,36,27,12,44,44,8,14,26,17,28],13)
用python实现算法之——选择排序
最新推荐文章于 2022-02-28 09:57:07 发布