Simple Quicksort in Python

basicquicksort.py

def quicksort(arr):
	if len(arr) <= 1:
		return arr
	else:
		pivot = arr[0]
		less = []
		equal = []
		more = []
		for elem in arr:
			if elem < pivot:
				less.append(elem)
			elif elem > pivot:
				more.append(elem)
			else:
				equal.append(elem)
		less = quicksort(less)
		more = quicksort(more)
		return less + equal + more
	
arr = [9,3,2,5,1,6,4,8,7]
print(quicksort(arr))