摘要: def bubbleSort(nums): i = len(nums) - 1 while (i > 0): last_index = 0 for j in range(i): if nums[j] > nums[j+1]: nums[... 阅读全文
posted @ 2017-09-01 23:18 715776681 阅读(150) 评论(0) 推荐(0) 编辑