Quicksort using list comprehensions

Python-Quicksort.py

#source: http://en.literateprograms.org/Quicksort_(Python)
def qsort1(list):
    """Quicksort using list comprehensions"""
    if list == []:
        return []
    else:
        pivot = list[0]
        lesser = qsort1([x for x in list[1:] if x < pivot])
        greater = qsort1([x for x in list[1:] if x >= pivot])
        return lesser + [pivot] + greater

numbers = (1,6,3,32,85,23,9,123,23,336)

print qsort1(numbers)

This may not be intuitive at first sight. But that's always with recursion. Through list comprehension program is reduced into two logical lines. That makes it easy to get what's going on here.