Wikipedia:冒泡排序
代码:
def bubble_sort(lst):
Pos = 1
while (Pos > 0):
Pos = 0
for i in xrange(len(lst)-1):
if lst[i]>lst[i+1]:
lst[i],lst[i+1]=lst[i+1],lst[i]
Pos =1
return lst
Wikipedia:冒泡排序
代码:
def bubble_sort(lst):
Pos = 1
while (Pos > 0):
Pos = 0
for i in xrange(len(lst)-1):
if lst[i]>lst[i+1]:
lst[i],lst[i+1]=lst[i+1],lst[i]
Pos =1
return lst