算法

一、冒泡排序

li = [13, 22, 6, 99, 11]

for i in range(1,len(li):
    for m in range(len(li)-i): 
        if li[m] > li[m+1]:
            temp = li[m+1]
            li[m+1] = li[m]
            li[m] = temp

 

转载于:https://www.cnblogs.com/LiCheng-/p/6441936.html