网上还有很多关于冒泡算法的列子,在这里我主要利用的python中的分片及其分片赋值的原理来完成,^_^_^_^_^_^ ,在下一文章中我将尝试选择排序
[leo@hadoop ~]$ cat loop.py
a=[3,4,1,6,8,2,13,3,23,25,78]
ax=a[:]
alen=len(a)
print "a is ",a
for x in range(alen):
blen=alen-x
b=a[0:blen]
# print "before",b
for i,va in enumerate(b):
if i<blen-1:
k=b[i+1]
if va<k:
b[i+1]=va
b[i]=k
# print "loop",x,"b:",b
a[0:alen-x]=b
# print "loop",x,"a:",ax
print a
[leo@hadoop ~]$ python loop.py
a is [3, 4, 1, 6, 8, 2, 13, 3, 23, 25, 78]
[78, 25, 23, 13, 8, 6, 4, 3, 3, 2, 1]
[leo@hadoop ~]$ cat loop.py
a=[3,4,1,6,8,2,13,3,23,25,78]
ax=a[:]
alen=len(a)
print "a is ",a
for x in range(alen):
blen=alen-x
b=a[0:blen]
# print "before",b
for i,va in enumerate(b):
if i<blen-1:
k=b[i+1]
if va<k:
b[i+1]=va
b[i]=k
# print "loop",x,"b:",b
a[0:alen-x]=b
# print "loop",x,"a:",ax
print a
[leo@hadoop ~]$ python loop.py
a is [3, 4, 1, 6, 8, 2, 13, 3, 23, 25, 78]
[78, 25, 23, 13, 8, 6, 4, 3, 3, 2, 1]