Python冒泡排序

def testsort(list):
    '''
    冒泡排序
    :param list:
    :return:
    '''
    for i in range(len(list)):
        for j in range(len(list)-1):
            if list[j]<list[j+1]:
                list[j],list[j+1]=list[j+1],list[j]
    return list

a=[2,1,233,1,4,1]
print(testsort(a))

输出：[233, 4, 2, 1, 1, 1]