Quick Sort Simple

quicksort_simple.py

def quicksort(arr):
	len_arr = len(arr)

	if(len_arr<2):
		return arr
	else:
		lower = []	
		upper = []
		pivot = []
		pivot.append(arr[len_arr-1])
	
		for i in arr:
			if(i < arr[len_arr-1]):
				lower.append(i)
			elif(i > arr[len_arr-1]):
				upper.append(i)
			elif(i == arr[len_arr-1]):
				pivot.append(i)
	
		return quicksort(lower)+pivot+quicksort(upper)

print quicksort([1,2,1,5,7,3,6,8,10,33,12,9])