Python_冒泡排序

# -*-coding:utf-8
# python_study
# 冒泡排序.py
# @Author: Glad
# @Time: 2021/3/3 10:21

def bubble_sort(alist):
    n = len(alist)
    for i in range(0,n-1):
        flag = 0  #标识，用作优化，此时最优时间复杂度为n,就是内层循环的次数.
        for j in range(0,n-1-i):
            if alist[j]>alist[j+1]:
                alist[j],alist[j+1] = alist[j+1],alist[j]
                flag += 1 #如果实现了交换数据的位置，flag就加上1
        if flag ==0: #如果flag等于0，说明序列没有实现数据的交换，则退出
            return alist
    return  alist
if __name__ == '__main__':
    alist = [9, 8, 7, 6, 5, 4, 3, 2, 1]
    print(alist)    # 输出结果：[9, 8, 7, 6, 5, 4, 3, 2, 1]
    bubble_sort(alist)
    print(alist)    # 输出结果：[1, 2, 3, 4, 5, 6, 7, 8, 9]