摘要: 冒泡算法: 实现1: a = [10,4,33,21,54,3,8,11,5,22,2,1,17,13,6] def bubble(badlist): sort = False while not sort: sort = True for i in range(len(badlist)-1): i 阅读全文
posted @ 2016-02-13 22:21 tec2019 阅读(204) 评论(0) 推荐(0) 编辑