def quick_sort(arr): if len(arr) <= 1: return arr else: pivot = arr[0] left = [x for x in arr[1:] if x < pivot] right = [x for x in arr[1:] if x >= pivot] return quick_sort(left) + [pivot] + quick_sort(right)
写一个Python快速排序的非递归的代码
最新推荐文章于 2024-07-19 13:59:11 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)