冒泡插入选择

def maopao_sort(args):
    for i in range(1,len(args)):
        for j in range(0,len(args)-i):
            if args[j] > args[j+1]:
                temp = args[j]
                args[j] = args[j+1]
                args[j+1] = temp
    return args
print(maopao_sort(lis))
lis = [10, 77, 12, 43, 88, 1, 8, 8, 2, 3, 6]
#10,77
#10,12,77
#10,12,43,77,1,88,
def xuanze_sort(args):
    for i in range(0,len(args)):
        min_index = i
        for j in range(i+1,len(args)):
            if args[j] < args[min_index]:
                min_index = j
        temp = args[i]
        args[i] = args[min_index]
        args[min_index] = temp
    return args
print(xuanze_sort(lis))
def caru_sort(args):
    for i in range(1,len(args)):
        for j in range(i-1,-1,-1):
            if args[j] >args[j+1]:
                temp = args[j]
                args[j] = args[j+1]
                args[j+1] = temp
            else:
                break
    return args
print(caru_sort(lis))