数据结构&算法积累
1 快速排序
参考:https://blog.csdn.net/weixin_43250623/article/details/88931925
def quick_sort(nums, start, end):
if start > end:
return
mid = nums[start]
low = start
high = end
while low < high:
while low < high and
原创
2020-08-11 17:38:03 ·
125 阅读 ·
0 评论