Python编程：排序算法之冒泡排序

import random
# 冒泡排序，从小到大排序O(n^2)
def bubble_sort(lst):
    count = 0
    n = len(lst) - 1  # 9 总遍历次数，比序列总数少1
    for i in range(n): # 0-8
        for j in range(n-i): # 8-0
            if lst[j]>lst[j+1]:  # 前者比后者大则交换
                lst[j], lst[j+1] = lst[j+1], lst[j]
            count += 1
    print("count: %s", count)
# 冒泡排序改进，从小到大排序
def bubble_sort_1(lst):
    count = 0
    n = len(lst) - 1  # 9 总遍历次数，比序列总数少1
    for i in range(n): # 0-8
        exchange = False
        for j in range(n-i): # 8-0
            if lst[j]>lst[j+1]:  # 前者比后者大则交换
                lst[j], lst[j+1] = lst[j+1], lst[j]
                exchange = True
            count += 1
        if exchange==False:  # 如果遍历结束没有任何交换,说明已经有序
            break
    print("count: %s", count)
lst = list(range(10))
# random.shuffle(lst) #打乱顺序
bubble_sort(lst)
# count: %s 45
bubble_sort_1(lst)
# count: %s 9
print(lst)
# [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]