def bubble_sort(li):
# O(n2)
for i in range(len(li) - 1):
for j in range(len(li) - i - 1):
if li[j] > li[j + 1]:
li[j], li[j + 1] = li[j + 1], li[j]
# 优化过后的冒泡排序
def bubble_sort1(li):
# O(n2)
for i in range(len(li) - 1):
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
if not exchange:
return
原文：https://www.cnblogs.com/argos/p/14288613.html