Quicksort python

quicksort.py

def quicksort(array):
    if len(array) <= 1:
        return array
    less = []
    more = []
    equal = []
    pivot = array[len(array)/2]
    for x in array:
        if x < pivot:
            less.append(x)
        elif x > pivot:
            more.append(x)
        else:
            equal.append(x)
    return quicksort(less) + quicksort(equal) + quicksort(more)

if __name__ == "__main__":
    data = [1, 10, 50, 14, 1200, 0541, 65434, -1, -2341421, 132412, 1214,124,142124,125, 124, 123, 122, 121]
    print quicksort(data)