QUICKSORT PSEUDOCODE

QUICKSORT( A, left, right )
    if left < right
        pivot = PARTITION( A, left, right )
        QUICKSORT( A, left, pivot - 1 )
        QUICKSORT( A, pivot + 1, right )
        
PARTITION( A, left, right )
    pivot = A[ right ]
    i = left - 1
    for j = left to right - 1
        if A[ j ] <= pivot
            i = i + 1
            swap A[ i ] with A[ j ]
    swap A[ i + 1 ] with A[ right ]
    return i + 1