could I do a quicksort algorithm based on this code for partitioning?

Question

def quicksort(A):
    a = A.pop(len(A)-1)
    c = []
    g = []
    for b in range(len(A)):
        if A[b] > a:
            c += [A[b]]
        else:
            g += [A[b]]
    A = g
    A += [a]
    A += c
    m = len(g)
    return A

this code does the partitioning, could I make a quick sort algorithm by adding something to it or doing some recursive calls