冒泡法排序:
n = 6
lst = [0] * n
for I in range(n):
lst[I] = input('>>')
for K in range(n-1):
flag = False
for I in range(n-1-K):
if lst[I] > lst[I+1]:
lst[I],lst[I+1] = lst[I+1],lst[I]
flag = True
if not flag:
break
print(lst)
Python--冒泡法排序
最新推荐文章于 2021-12-22 21:21:15 发布