最简单的冒泡排序

num1 = [87,4,54,4521,123,1]

for i in range(len(num1)-1):

for j in range(len(num1)-1):

if num1[j] >num1[j+1]:

num1[j+1],num1[j] = num1[j],num1[j+1]

print(num1)

函数的方式

def maopao(list1):

n = len(list1)

for i in range(n - 1):

for j in range(i + 1, n):

if list1[i] > list1[j]: # 通过交换让最小的在最前面

list1[i], list1[j] = list1[j], list1[i]

if name == ‘main’:

list1 = [1, 5, 3, 2]

maopao(list1)

详细地址
https://www.cnblogs.com/SteveWesley/p/10007987.html