冒泡排序-python实现

冒泡排序

代码

# coding=utf-8
# 事例
arr = [4, 5, 7, 9, 2, 6, 8, 1, 3, 0]
# 交换值
def swap(j):
    arr[j] = arr[j] ^ arr[j+1]
    arr[j+1] = arr[j] ^ arr[j + 1]
    arr[j] = arr[j] ^ arr[j + 1]
# 冒泡排序
def bubbing():
    for i in range(1,len(arr),1):
        for j in range(0,len(arr) - i,1):
            if arr[j] > arr[j+1]:
                swap(j)
    print(arr)

bubbing()

运行结果:

i外循环 j内循环
i = 1 j = 04579268130
i = 1 j = 14579268130
i = 1 j = 24579268130
i = 1 j = 34572968130
i = 1 j = 44572698130
i = 1 j = 54572689130
i = 1 j = 64572681930
i = 1 j = 74572681390
i = 1 j = 84572681309
i = 1 j = 84572681309
i = 2 j = 04572681309
i = 2 j = 14572681309
i = 2 j = 24527681309
i = 2 j = 34526781309
i = 2 j = 44526781309
i = 2 j = 54526718309
i = 2 j = 64526713809
i = 2 j = 74526713089
i = 3 j = 04526713089
i = 3 j = 14256713089
i = 3 j = 24256713089
i = 3 j = 34256713089
i = 3 j = 44256173089
i = 3 j = 54256137089
i = 3 j = 64256130789
i = 4 j = 02456130789
i = 4 j = 12456130789
i = 4 j = 22456130789
i = 4 j = 32451630789
i = 4 j = 42451360789
i = 4 j = 52451306789
i = 5 j = 02451306789
i = 5 j = 12451306789
i = 5 j = 22415306789
i = 5 j = 32413506789
i = 5 j = 42413056789
i = 6 j = 02413056789
i = 6 j = 12143056789
i = 6 j = 22134056789
i = 6 j = 32130456789
i = 7 j = 01230456789
i = 7 j = 11230456789
i = 7 j = 21203456789
i = 8 j = 01203456789
i = 8 j = 11023456789
i = 9 j = 00123456789
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值