def quicksort(l):
	if(len(l)<=1):
		return l
	less,greater = ([],[])
	pivot = len(l)/2
	for n in l:
		if l[n] <= l[pivot] and not l.__contains__(n):
			less.append(l[n])
		elif not l.__contains__(n):
			greater.append(l[n])
	less.append(l[pivot])
	return quicksort(less) + quicksort(greater)

if __name__ == '__main__':
	listToBeSorted = [1,6,1,3,7,3,4,7,9,2,3,6,12,13]
	print quicksort(listToBeSorted)