Recursive QuickSort Algorithm

def QuickSort(Array):
    if len(Array) == 0:
        return []
    RightArray = []
    LeftArray = []
    Pivot = Array[0]
    n = 1
    while n < len(Array):
        if Array[n] >= Pivot:
            RightArray.append(Array[n])
        else:
            LeftArray.append(Array[n])
        n += 1
    return QuickSort(LeftArray) + [Pivot] + QuickSort(RightArray)