51.冒泡排序

# 系统排序方法
'''
    .sort()
    sorted()
'''
'''
    numbers = [2,4,6,8,0,1,3,5,7,9]
    numbers = sorted(numbers)
    print(numbers)
# [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
    numbers = [2,4,6,8,0,1,3,5,7,9]
    numbers = sorted(numbers,reverse=True)
    print(numbers)
# [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
# 或者
    numbers = [2,4,6,8,0,1,3,5,7,9]
    numbers.sort(reverse=True)
    print(numbers)
'''

# 冒泡排序
numbers = [2,8,6,1]
for i in range(len(numbers)):
    for j in range(i+1,len(numbers)):
        if numbers[i] > numbers[j]:
            # 快速交换
            numbers[i],numbers[j] = numbers[j],numbers[i]
print(numbers)
'''
内层for: 找到最小值放到最前面
    for i in range(1,10):
    for j in range(2,10)
    if 2>4:
    ...
    if 2>0: ---->True
    2,0 = 0,2
    2<--->0 互换位置
    [0, 4, 6, 8, 2, 1, 3, 5, 7, 9]
    以此类推
'''
mylist = [3,2,4,1]
for i in range(len(mylist)-1):
    for j in range(len(mylist)-1-i):
        if mylist[j] > mylist[j+1]:
            mylist[j],mylist[j+1] = mylist[j+1],mylist[j]
            print(mylist)
print(mylist)
'''
分析:
    for i in range(3)
                3,2,4
        for j in range(3)
                3,2,4
            j=0
            if 3 > 2:
            [2, 3, 4, 1]
            j = 1
            j = 2
            if 4 > 1:
            [2, 3, 1, 4]
下一轮
    for i in range(2)
            2,3,4
以此类推
'''