冒泡排序法:
alist = [3,5,7,8,4,2]
i = 0
定义一个数作为alist的索引,存放比较数的前面的数
while(i<len(alist)):
j = i+1
while(j<len(alist)):
if alist[i]>alist[j]:
b = alist[i]
alist[i] = alist[j]
alist[j] = b
j+=1
i+=1
print(alist)