摘要: 题1: 冒泡排序: def bubbling(nums): n = len(nums) for j in range(n-1): count = 0 """2、从头走到尾,执行多少次,n-1次""" """j = 0,1,2...n-2; range(0,n-1)""" """i =n-1-0,n- 阅读全文
posted @ 2023-02-22 18:28 zxy_ang 阅读(20) 评论(0) 推荐(0)