python实现冒泡排序算法

python实现冒泡排序算法，代码和简单解释如下

def bubble_sort(numbers):
    length = len(numbers)#列表长度
    for i in range(length - 1):#需要遍历次数
        for j in range(length - i - 1):#每次遍历，比较的数列元素
            if numbers[j] > numbers[j + 1]:
                numbers[j], numbers[j + 1] = numbers[j + 1], numbers[j]#对调j和j+1位
    return numbers


if __name__ == "__main__":
    numbers = [111, 5, 115, 36]
    numbers = bubble_sort(numbers)
    print(numbers)  # [5, 36, 111, 115]