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)