冒泡排序

import random


def bubbling_sort(_list):
    length_1 = len(_list)-1
    for i in range(length_1):
        is_exchange = False
        for j in range(length_1-i):
            if _list[j] > _list[j+1]:
                _list[j], _list[j+1] = _list[j+1], _list[j]
                is_exchange = True
        if not is_exchange:
            break


if __name__ == '__main__':
    lis = [random.randint(0, 100) for i in range(100)]
    print(lis)
    bubbling_sort(lis)
    print(lis)

冒泡排序是稳定排序