Author: Stan Eisenstat
Subject: Re: [Cs223] Additional N calls AND Typo
Date: Monday, 16 Mar 2020, 19:46:49

    > Message Posted By: Unknown
    >
    > I am confused about the time constraint 2*#compares + N calls to
    > addD()/pushdD(). Does the additional N calls mean if we are sorting N
    > items in total, we can use additionally N calls or during one recursion,
    > there is N items to be sorted and we can use additionally N calls?

The +N allows quickSort to add/push the pivot back to a
Deque each time that it is called.  Thus the total over
ALL recursive calls is N.

--Stan-