Python 实现冒泡排序

def bubbleSort( theSeq ):
    n = len( theSeq )
    # Perform n-1 bubble operations on the sequence
    for i in range( n - 1 ) :
        # Bubble the largest item to the end.
        for j in range( n - i -1 ) :
            if theSeq[j] > theSeq[j + 1] : # swap the j and j+1 items.
                tmp = theSeq[j]
                theSeq[j] = theSeq[j + 1]
                theSeq[j + 1] = tmp
In [42]: import random                
                
In [50]: aList = []

In [51]: for i in range(20):
   ....:     aList.append(random.randint(1,20))
   ....:

In [52]: aList
Out[52]: [17, 15, 2, 15, 8, 20, 1, 11, 8, 3, 5, 2, 17, 2, 3, 16, 7, 11, 18, 17]

In [53]: bubbleSort(aList)

In [54]: aList
Out[54]: [1, 2, 2, 2, 3, 3, 5, 7, 8, 8, 11, 11, 15, 15, 16, 17, 17, 17, 18, 20]


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值