Python 冒泡排序

标签：冒泡排序   排序   --   als   aop   hello   false   python2   ber   

def maopao_sort(numbers):
for i in range(len(numbers)):
print "-----------------------",i;
for j in range(len(numbers)-1-i):
b = True ;
if numbers[j] > numbers[j+1] :
a = numbers[j+1] ;
numbers[j+1] = numbers[j] ;
numbers[j] = a ;
b= False ;
print numbers ;
maopao_sort(numbers)

Python 冒泡排序

标签：冒泡排序   排序   --   als   aop   hello   false   python2   ber   

原文地址：http://blog.51cto.com/13890306/2150955