经典算法之冒泡排序法实例：
正序：
x = [1,12,5,3,4,2,5,8,11,23,4,6,7] y = 1 while y < len(x): for i in range(0,len(x)-y): if x[i] > x[i+1]: x[i], x[i+1] = x[i+1], x[i] # temp = x[i+1] # x[i+1] = x[i] # x[i] = temp y += 1 print (x) [1, 2, 3, 4, 4, 5, 5, 6, 7, 8, 11, 12, 23]倒序：
x = [1,12,5,3,4,2,5,8,11,23,4,6,7] y = 1 while y < len(x): for i in range(0,len(x)-y): if x[i] < x[i+1]: x[i], x[i+1] = x[i+1], x[i] y += 1 print (x) [23, 12, 11, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1]