快速排序的原理：
1.列表最左边的元素归位
2.递归
def partition(data_list,left,right):
temp = data_list[left]
while left < right:
while left < right and data_list[right] >= temp:
right -= 1
data_list[left] = data_list[right]
while left < right and data_list[left] <= temp:
left += 1
data_list[right] = data_list[left]
data_list[left] = temp
return left
def quick_sort(data_list,left,right):
if left < right:
mid = partition(data_list,left,right)
quick_sort(data_list,left,mid-1)
quick_sort(data_list,mid+1,right)
return data_list
data_list = [11,2,35,4,16,25]
print(quick_sort(data_list, 0, len(data_list) - 1))
