python实现冒泡排序

def paixu(list):
    # 排序的轮次
    for i in range(1, len(list)):
        # 每一轮比较的次数
        for j in range(0, len(list)-i):
            if list[j] > list[j+1]:
                list[j], list[j+1] = list[j+1], list[j]
    return array
 
 
if __name__ == '__main__':
    list1= [10, 17, 50, 7, 30, 24, 27, 45, 15, 5, 36, 21]
    result = paixu(list1)