摘要: 冒泡排序 nums = [6, 5, 3, 1, 8, 7, 2, 4] j = 0 while j < len(nums) - 1: flag = True i = 0 while i < len(nums) - 1 - j: if nums[i] > nums[i + 1]: flag = Fa 阅读全文
posted @ 2020-09-04 16:20 李淳罡zZ 阅读(133) 评论(0) 推荐(0)