quickSort

def quickSort(arr):
	less = []
	equal = []
	greater = []
	if len(arr) < 2:
		return arr
	pivot = arr[len(arr) // 2]
	for element in arr:
		if element < pivot:
			less.append(element)
		elif element > pivot:
			greater.append(element)
		else:
			equal.append(element)
	return quickSort(less) + equal + quickSort(greater)