摘要: #冒泡算法ll = [22,13,11,99,6,33,67,4]p = len(ll)-1print pwhile True: for i in xrange(p): n1 = ll[i] n2 = ll[i+1] if n1 > n2: tmpn = n1 ll[i] = n2 ll[i+1] ... 阅读全文
posted @ 2015-11-20 15:36 plzros 阅读(132) 评论(0) 推荐(0) 编辑