def quicksort(nums, l, r):
a = l
b = r
if l >= r:
return
while l < r:
while l<r and nums[r]>nums[a]:
r -= 1
while l<r and nums[l]<=nums[a]:
l += 1
nums[l], nums[r] = nums[r], nums[l]
#print(a, r, l, b)
nums[a], nums[r] = nums[r], nums[a]
quicksort(nums, a, r-1)
quicksort(nums, r+1, b)
快排的代码各式各样,我自己写了一个python的简单模板,供自己参考