python的快速排序怎么写

中文快速排序算法的实现如下：def quick_sort(list):
if len(list) <= 1:
return list
else:
pivot = list[0]
left_list = [x for x in list[1:] if x < pivot]
right_list = [x for x in list[1:] if x >= pivot]
return quick_sort(left_list) + [pivot] + quick_sort(right_list)