Python-冒泡排序
def bubble_sort(li):
for i in range(len(li) - 1): # 第i趟
exchange = False
for j in range(len(li) - i - 1):
if li[j] > li[j+1]:
li[j], li[j+1] = li[j+1], li[j]
exchange = True
print(li)
if not exchange:
return
li = [0, 2, 3, 9, 4, 1, 8, 6, 7, 5]
print(li)
bubble_sort(li)
浙公网安备 33010602011771号