Python實現冒泡排序

冒泡排序法
l1=[66,3,6,5,2]
1、先通過if語句進行兩兩對比，交換位置，使最大的數值下沉至末尾
# if l1[0]>l1[1]:
# l1[0],l1[1]=l1[1],l1[0]
# print(l1)
# if l1[1]>l1[2]:
# l1[1],l1[2]=l1[2],l1[1]
# print(l1)
# if l1[2]>l1[3]:
# l1[2],l1[3]=l1[3],l1[2]
# print(l1)
# if l1[3]>l1[4]:
# l1[3],l1[4]=l1[4],l1[3]
# print(l1)
2、通過第一步發現規律，通過循環完成第一步的兩兩交換位置
# for i in range(len(l1)-1):
# if l1[i] > l1[i+1]:
# l1[i], l1[i+1] = l1[i+1], l1[i]
# print(l1)
# for i in range(len(l1)-1):
# if l1[i] > l1[i+1]:
# l1[i], l1[i+1] = l1[i+1], l1[i]
# print(l1)
# for i in range(len(l1)-1):
# if l1[i] > l1[i+1]:
# l1[i], l1[i+1] = l1[i+1], l1[i]
# print(l1)
# for i in range(len(l1)-1):
# if l1[i] > l1[i+1]:
# l1[i], l1[i+1] = l1[i+1], l1[i]
# print(l1)
3、通過第二步發現要使用多次循壞才能完成最后的交換規律，再嵌套一層循環進行最后的優化
for c in range(len(l1)):#要進行幾輪的兩兩交換
for i in range(len(l1) - 1):
if l1[i] > l1[i + 1]:
l1[i], l1[i + 1] = l1[i + 1], l1[i]
print(l1)