#！/usr/bin/envpython#-*-coding:utf-8-*-defmp_sort(numbers):foriinrange(len(numbers)-1):forjinrange(len(numbers)-i-1):ifnumbers[j]>numbers[j+1]:numbers[j],numbers[j+1]=numbers[j+1],numbers[j]returnnumbersprintmp_sort([2,34,55,43,2,3,56,67,45])

#常见的冒泡排序法，如[7,2,5,1,4]

当 i = 0 ，进入第二个for , 循环次数5-0-1=4次，当j = 0 [2,7,5,1,4]

j = 1 [2,5,7,1,4]

j = 2 [2,5,1,7,4]

j = 3 [2,5,1,4,7]

当 i = 1 ，进入第二个for , 循环次数5-1-1=3次, 当j = 0 [2,5,1,4,7]

j = 1 [2,1,5,4,7]

j = 2 [2,1,4,5,7]

当 i = 2 ，进入第二个for , 循环次数5-2-1=2次, 当j = 0 [1,2,4,5,7]

j = 1 [1,2,4,5,7]

当 i = 3 ，进入第二个for , 循环次数5-3-1=1次, 当j = 0 [1,2,4,5,7]