Mazdak Farrokhzad edited d) Quicksort average complexity.tex  about 10 years ago

Commit id: 04df58b7673d7abb63c50cb7edceb890ed2dc3be

deletions | additions      

       

\begin{subequations}  \begin{align*}  C(n) = \begin{cases}  1 & \text{if } n = 1\\ 0\\  \frac{2}{n} \displaystyle\sum_{i=0}^{n-1} \left[ C(i) \right] + n & \text{if } n > 0  \end{cases}  \end{align*}  \end{subequations}