Crude implementation of Quicksort algorithm in Python.

quicksort.py

def quicksort(list):
    if len(list) <= 1: return list 
    pivot = list[0]
    great = []
    less = []
    
    for item in list[1:]:
        if item>=pivot:
            great.append(item)
        elif item<pivot:
            less.append(item)
            
    return quicksort(less)+[pivot]+quicksort(great)

#test    
print quicksort([45,99,1,-22,7,3,294,10,36])