快速排序Python

1def partition(arr, low, high):
2	i = low - 1
3	pivot = arr[high]
4	for j in range(low, high):
5		if arr[j] <= pivot:
6			i = i+1
7			arr[i],arr[j] = arr[j],arr[i]
8	arr[i+1],arr[high] = arr[high],arr[i+1]# ???
9	return i+1
10
11def quick_sort(arr, low, high):
12	if low < high:
13		pi = partition(arr,low,high)
14		quick_sort(arr, low, pi-1)
15		quick_sort(arr, pi+1, high)
16arr = [3,2,9,34,5,3,9,7,0,1]
17quick_sort(arr, 0, len(arr)-1)
18print(arr)