def Sort(alist): # 修改后的冒泡排序
    exchanges = True
    sum = len(alist)-1
    while sum >0 and exchanges:
        exchanges = False
        for i in range(sum):
            if alist[i] > alist[i+1]:
                exchanges = True
                temp = alist[i]
                alist[i] = alist[i+1]
                alist[i+1] = temp
        sum = sum -1
    return alist
alist = [8,2,3,5,4,6,7,1]

print(Sort(alist))