quick_sort.py

def partition(L, low, high):
	pivot = L[high]

	i = low - 1
	for j in range(low, high):
		if L[j] < pivot:
			i += 1
			L[i], L[j] = L[j], L[i]

	L[i+1], L[high] = L[high], L[i+1]
	return i+1


def quick_sort(L, low, high):
	if low >= high:
		return
	p = partition(L, low, high)
	quick_sort(L, low, p-1)
	quick_sort(L, p+1, high)


if __name__ == "__main__":
	L = [1, 5, 6, 3, 8, 4, 7, 2]
	quick_sort(L, 0, len(L)-1)
	print(L)