您好,登錄后才能下訂單哦!
#!/usr/bin/env python # -*- coding:utf-8 -*- def mp_sort(numbers): for i in range(len(numbers)-1): for j in range(len(numbers) - i -1): if numbers[j] > numbers[j+1]: numbers[j],numbers[j+1] = numbers[j+1],numbers[j] return numbers print mp_sort([2,34,55,43,2,3,56,67,45])
#常見(jiàn)的冒泡排序法,如[7,2,5,1,4]
當(dāng) i = 0 ,進(jìn)入第二個(gè)for , 循環(huán)次數(shù)5-0-1=4次,當(dāng)j = 0 [2,7,5,1,4]
j = 1 [2,5,7,1,4]
j = 2 [2,5,1,7,4]
j = 3 [2,5,1,4,7]
當(dāng) i = 1 ,進(jìn)入第二個(gè)for , 循環(huán)次數(shù)5-1-1=3次, 當(dāng)j = 0 [2,5,1,4,7]
j = 1 [2,1,5,4,7]
j = 2 [2,1,4,5,7]
當(dāng) i = 2 ,進(jìn)入第二個(gè)for , 循環(huán)次數(shù)5-2-1=2次, 當(dāng)j = 0 [1,2,4,5,7]
j = 1 [1,2,4,5,7]
當(dāng) i = 3 ,進(jìn)入第二個(gè)for , 循環(huán)次數(shù)5-3-1=1次, 當(dāng)j = 0 [1,2,4,5,7]
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。