摘要： 1、冒泡排序 #Author: Caesars l = [12,65,67,21,3,9,50,24] for i in range(len(l)): for j in range(len(l)-i-1): if l[j] > l[j+1]: a = l[j] l[j] = l[j+1] l[j+1 阅读全文