排序

冒泡排序

#冒泡排序
def exchange(i,j):
    temp = list[i]
    list[i] = list[j]
    list[j] = temp
list = [5,9,1,3,4,6,8,2,0]
# list = [0, 1, 2, 3, 4, 5, 6, 8, 9]
#方法一：正序
for i in range(len(list)):
    for j in range(i+1,len(list)):
        if list[i] > list[j]:
            exchange(i,j)
print(list)

#方法二：倒序
for i in range(len(list)):
    j = len(list) - 2
    while j >= i:
        if list[j] > list[j+1]:
            exchange(j,j+1)
        j -= 1
print(list)

# 方法三：改进二方法
flag = True
i = 0
while i < len(list) and flag == True:
    j = len(list) - 2
    flag = False
    while j >= i:
        if list[j] > list[j+1]:
            exchange(j,j+1)
            flag = True
        j -= 1
    i += 1
print(list)

#方法四
for i in range(len(list)-1):
    for j in range(len(list)-1-i):
        if list[j] > list[j+1]:
            exchange(j,j+1)
print(list)

等我学完我再更新。。。