Function quickSort

Sorting Algorithms/quick_sort.py:34–40

(array, low, high)

def quickSort(array, low, high):
	if low < high:
		pi = partition(array, low, high)

		quickSort(array, low, pi - 1)

		quickSort(array, pi + 1, high)


A= [4,6,2,7,8,3,0]