python的快速排序怎么写

Python中快速排序的实现大致如下：def quick_sort(arr):
if len(arr)<2:
return arr
else:
pivot = arr[0]
less = [i for i in arr[1:] if i<pivot]
greater = [i for i in arr[1:] if i>=pivot]
return quick_sort(less) + [pivot] + quick_sort(greater)