算法-06-冒泡排序

 

 

 

import random


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]


li = [random.randint(0, 20) for i in range(15)]
print(li)
bubble_sort(li)
print(li)


该进;

def bubble_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


li = [9,8, 7, 1, 2, 3, 4]

lil = [1, 2, 3, 4]

bubble_sort(li)
print("输出： "+str(li))
bubble_sort(lil)