python中冒泡排序解析

上代码!

a = [4,8,9,7,5,98,14,15,5,25]
# 冒泡排序:比较的是 4,8;8,9;9,7;7,5;5,3,;3,14;14,15;15,98;98,25之间的的大小
# 所有说 从0开始 只有8对
for i in range(0,len(a)-1):  # 第一个轮次:得到了 [4, 8, 7, 5, 9, 14, 15, 5, 25, 98] 最大一般排在最后
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

# 第二轮结合第一接着写:第一轮得到最后一位最大数字,现在只需比较7位数字
for i in range(0,len(a)-2):  # 第二个轮次:得到了 [4, 7, 5, 8, 9, 14, 5, 15, 25, 98] 第二大的25排在倒数第二个
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

for i in range(0,len(a)-3):
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

for i in range(0,len(a)-4):
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

for i in range(0,len(a)-5):
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

for i in range(0,len(a)-6):
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

for i in range(0,len(a)-7):
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)

for i in range(0,len(a)-8):
    if a[i] > a[i+1]:
        a[i],a[i+1] = a[i+1], a[i]
    print(a)


执行结果:

[4, 8, 9, 7, 5, 98, 14, 15, 5, 25]
[4, 8, 9, 7, 5, 98, 14, 15, 5, 25]
[4, 8, 7, 9, 5, 98, 14, 15, 5, 25]
[4, 8, 7, 5, 9, 98, 14, 15, 5, 25]
[4, 8, 7, 5, 9, 98, 14, 15, 5, 25]
[4, 8, 7, 5, 9, 14, 98, 15, 5, 25]
[4, 8, 7, 5, 9, 14, 15, 98, 5, 25]
[4, 8, 7, 5, 9, 14, 15, 5, 98, 25]
[4, 8, 7, 5, 9, 14, 15, 5, 25, 98]
[4, 8, 7, 5, 9, 14, 15, 5, 25, 98]
[4, 7, 8, 5, 9, 14, 15, 5, 25, 98]
[4, 7, 5, 8, 9, 14, 15, 5, 25, 98]
[4, 7, 5, 8, 9, 14, 15, 5, 25, 98]
[4, 7, 5, 8, 9, 14, 15, 5, 25, 98]
[4, 7, 5, 8, 9, 14, 15, 5, 25, 98]
[4, 7, 5, 8, 9, 14, 5, 15, 25, 98]
[4, 7, 5, 8, 9, 14, 5, 15, 25, 98]
[4, 7, 5, 8, 9, 14, 5, 15, 25, 98]
[4, 5, 7, 8, 9, 14, 5, 15, 25, 98]
[4, 5, 7, 8, 9, 14, 5, 15, 25, 98]
[4, 5, 7, 8, 9, 14, 5, 15, 25, 98]
[4, 5, 7, 8, 9, 14, 5, 15, 25, 98]
[4, 5, 7, 8, 9, 5, 14, 15, 25, 98]
[4, 5, 7, 8, 9, 5, 14, 15, 25, 98]
[4, 5, 7, 8, 9, 5, 14, 15, 25, 98]
[4, 5, 7, 8, 9, 5, 14, 15, 25, 98]
[4, 5, 7, 8, 9, 5, 14, 15, 25, 98]
[4, 5, 7, 8, 9, 5, 14, 15, 25, 98]
[4, 5, 7, 8, 5, 9, 14, 15, 25, 98]
[4, 5, 7, 8, 5, 9, 14, 15, 25, 98]
[4, 5, 7, 8, 5, 9, 14, 15, 25, 98]
[4, 5, 7, 8, 5, 9, 14, 15, 25, 98]
[4, 5, 7, 8, 5, 9, 14, 15, 25, 98]
[4, 5, 7, 5, 8, 9, 14, 15, 25, 98]
[4, 5, 7, 5, 8, 9, 14, 15, 25, 98]
[4, 5, 7, 5, 8, 9, 14, 15, 25, 98]
[4, 5, 7, 5, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]
[4, 5, 5, 7, 8, 9, 14, 15, 25, 98]

简写:嵌套for循环

a = [4,8,9,7,5,98,14,15,5,25]

for y in range(1,len(a)):# 便利12345678
    for i in range(0,len(a)-y):
        if a[i] > a[i+1]:
            a[i],a[i+1] = a[i+1], a[i]
print(a)
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值