python算法_冒泡排序

对li列表排序

li = [13,6,22,14,7,99,77]

for n in range(1,len(li)-1):  #增加一层循环n

  for m in range(len(li)-n):  #该循环将在len范围内选出最大值放在右边,so需要在外壳增加一个范围的循n

   if li[m] > li[m+1]: #两数比较将大的值放置右边

    temp = li[m]

    li[m] = li[m+1]

    li[m+1] = li[m]

print li

结果:[6, 7, 13, 14, 22, 77, 99]

第二种方法: 

li = [13, 22, 6, 99, 11]

for m in range(len(li)-1):

  for n in range(m+1, len(li)):
  if li[m]> li[n]:
    temp = li[n]
    li[n] = li[m]
    li[m] = temp

print li

原文地址:https://www.cnblogs.com/fengzaoye/p/5726736.html