quick sort algorithm

quicksort.py

def split(array,first,last):
	left  = first
	right = last
	while left < right:
		while array[first] < array[right]:
			right -= 1
		while array[first] >= array[left] and left < right:
			left += 1
		if left < right:
			array[left],array[right] = array[right],array[left]
	array[first],array[left] = array[left],array[first]
	return left
def quickSort(array,first,last):
	if first < last:
		pos = split(array,first,last)
		quickSort(array,first,pos-1)
		quickSort(array,pos+1,last)
	return array