排序算法

a = [1, 9, 7, 3, 6, 2]


def maopao(a):
    """
  
    :param a:
    :return:
    """
    for j in range(len(a)):
        for i in range(len(a)-1):
            if a[i]>a[i+1]:
                a[i],a[i+1] = a[i+1],a[i]
    return a


def xuanze(a):
    for j in range(len(a)):
        for i in range(j,len(a)):
            if a[j] > a[i]:
                a[j], a[i] = a[i], a[j]
        print(a)
    return a


def charu(a):
    for j in range(2, len(a)):
        for i in range(0, j):
            if a[j-i] > a[j-i-1]:
                continue
            a[j-i], a[j-i-1] = a[j-i-1], a[j-i]
        print(a)


def xier(a):待定
        return a