参考老师的博客: 金角:http://www.cnblogs.com/alex3714/articles/5161349.html 银角:http://www.cnblogs.com/wupeiqi/articles/4963027.html 一.冒泡算法实例: a = [32,5,22,41,7,31,12,102,74,37,9,25] 1.方法1: count = 0for i in range(len(a)): for j in range(len(a)-1): if a[j] > a…