How to implement a counter into a recursive function, for instance quick sort

Question

This is a quick sort function.

def random_quick_sort(sequence):

    length = len(sequence)
    if length <= 1:
        return sequence

    L, R = [], []