Quicksort with Python

Question

I am totally new to python and I am trying to implement quicksort in it. Could someone please help me complete my code?

I do not know how to concatenate the three arrays and printing them.

def sort(array=[12,4,5,6,7,3,1,15]):
    less = []
    equal = []
    greater = []

    if len(array) > 1:
        pivot = array[0]
        for x in array:
            if x < pivot:
                less.append(x)
            if x == pivot:
                equal.append(x)
            if x > pivot:
                greater.append(x)
            sort(less)
            sort(pivot)
            sort(greater)

Answer 1

The quicksort algorithm is basically as follows:

1. Choose a pivot data point.
2. All data points less than (below) the pivot should be moved to a location below it, while those larger than or equal to (above) the pivot should be moved to a place above it.
3. The algorithm should be applied to the areas above and below the pivot.

If the data is distributed randomly, using the first data point as the pivot is comparable to a random pick.