Quicksort in Python

quicksort.py

def quicksort(list):
	# Define lists
	less = [] 
	equal = []
	greater = []

	if len(list) > 1: # Check if list have more than 1 element
		pivot = list[0] # This is now pivot value
		for number in list: # Go through numbers in list

		# Compare numbers with pivot value and add it to a right list
			if number < pivot:
				less.append(number) 
			elif number == pivot:
				equal.append(number)
			elif number > pivot:
				greater.append(number)
		# Sort and connect lists	
		return sort(less) + equal + sort(greater)
	else:
		# If list have only one value return list untouched
		return list