算法与数据结构---冒泡排序

def bubble_sort(li):
    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]
    return li


l = [1, 4, 6, 7, 8, 5, 9]
print(bubble_sort(l))


# 优化
def bubbles_sort(li):
    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
        print(li)
        if not exchange:
            return
    print(li)

l = [9,8,7,1,2,3,4,5]
print(bubbles_sort(l))

# 时间复杂度为O(n*n)