def partition(a)
	pivot = a[0]
	lesser = [x for x in a[1:] if x < pivot]
	greater = [x for x in a[1:] if x >= pivot]


def quicksort(a):
    if a == []:
        return []
    else:
        partition(a)
        lesser = quicksort(lesser)
        greater = quicksort(greater)
        a = lesser + [pivot] + greater