Function partition

Sorting Algorithms/quick_sort.py:16–31

(array, low, high)

def partition(array, low, high):

	pivot = array[high]

	i = low - 1

	for j in range(low, high):
		if array[j] <= pivot:

			i = i + 1

			array[i], array[j] = array[j], array[i]

	array[i + 1], array[high] = array[high], array[i + 1]

	return i + 1


def quickSort(array, low, high):