python实现冒泡排序

#此冒泡可以优化
ls = [45,89,7,57,42,63,74,41,32]
print(“排序前的列表顺序”,ls)
count = 0
while count < len(ls):
i = 0
while i < len(ls)-1:
if ls[i] > ls[i + 1]:
ls[i],ls[i+1] = ls[i+1],ls[i]
else:
pass
i = i + 1
count = count + 1
print(“使用冒泡排序后的列表ls”,ls)

#优化后的冒泡排序
count2 = 0
while count2 < len(ls):
i = 0
while i < len(ls)-1-count2:
if ls[i] > ls[i + 1]:
ls[i],ls[i+1] = ls[i+1],ls[i]
else:
pass
i = i + 1
count2 = count2 + 1
print(“优化后，使用冒泡排序后的列表ls”,ls)

#使用for循环
for i in range(len(ls)):
for j in range(len(ls)-i-1):
if ls[j] > ls[j+1]:
ls[j],ls[j+1] = ls[j+1],ls[j]
print(“使用for循环实现冒泡”,ls)