冒泡排序法和递归二分法举例
#冒泡排序lst = [156156, 156, 156, 1563, 123, 231, 456, 56, 1243, 453, 456]def func(lst):for i in range(len(lst) - 1):if lst[i] > lst[i + 1]:lst[i], lst[i + 1] = lst[i + 1], lst[i]return lstret = func(lst)print(ret)#递归二分法lst = [1, 2, 3, 15, 23, 56,
原创
2021-03-01 16:19:28 ·
112 阅读 ·
0 评论