# 冒泡排序:使用双重for循环,升序
numList = [1,0,9,-3,4,5,-2,10,2,6]
for i in range(0,len(numList)-1): # 外层循环控制轮数
for j in range(0,len(numList)-1-i): # 内层循环控制一轮两两交换的次数
if numList[j] > numList[j+1]:
temp = numList[j]
numList[j] = numList[j+1]
numList[j+1] = temp
print(numList)
# 冒泡排序:使用双重while循环,降序
numList = [1,0,9,-3,4,5,-2,10,2,6]
i = 0
while i < len(numList) - 1: # 外层循环控制轮数
j = 0
while j < len(numList) - 1 - i: # 内层循环控制一轮两两交换的次数
if numList[j] < numList[j+1]:
temp = numList[j]
numList[j] = numList[j+1]
numList[j+1] = temp
j += 1
i += 1
print(numList)
(YM实战经验)python实现冒泡排序
最新推荐文章于 2025-06-05 17:17:43 发布