def quick_sort(nums):
if len(nums) >= 2:
data = nums[0]
left, right = [], []
nums.remove(data)
for num in nums:
if num >= data:
right.append(num)
else:
left.append(num)
return quick_sort(left) + [data] + quick_sort(right)
else:
return nums
快速排序的实现 python3
最新推荐文章于 2020-11-28 17:02:23 发布