冒泡算法 

 

 

1 a=[1,55,7,22]
2 # a=[33,55,7,2]
3 for j in range(len(a)-1):
4     for i in range(len(a)-1):
5         if a[i] > a[i + 1]:
6             a[i],a[i+1]=a[i+1],a[i] # 这样是Python的特有写法，一次过换
7     print(a)

 

#！usr/bin/env python
# -*- coding:utf-8 -*-

a=[33,2,7,1]

for i in range(len(a)-1):
    if a[i] > a[i+1]:
        temp=a[i]
        a[i] = a[i+1]
        a[i+1] = temp
# print(a)
for j in range(len(a)-2):
    if a[j] > a[j+1]:
        temp=a[j]
        a[j] = a[j+1]
        a[j+1] = temp
print(a)

　　

 

a = [33, 2, 7, 1,21,4,8]

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

 

posted @ 2017-02-06 18:01  ezway  阅读(138)  评论(0)    收藏  举报