def mySort1(arg):
length = len(arg)
sort = []
for i in xrange(length):
min = arg.pop()
for j in xrange(len(arg)):
if min > arg[j]:
min,arg[j] = arg[j], min
sort.append(min)
print sort
mySort1([23,45,6,1,78,3,5,8,12,5,8,5,456,36,24,695])
方法2
def mySort2(arg):
for i in xrange(len(arg)-1,-1,-1):
for j in xrange(i):
if arg[j] > arg[j+1]:
arg[j], arg[j+1] = arg[j+1], arg[j]
print arg
mySort2([3243,57,2,121,6,83,4,1])
python 冒泡法实现列表排序2种方式
最新推荐文章于 2022-03-24 16:01:18 发布