this is for holding javascript data
Mazdak Farrokhzad edited d) Quicksort average complexity.tex
about 10 years ago
Commit id: 04df58b7673d7abb63c50cb7edceb890ed2dc3be
deletions | additions
diff --git a/d) Quicksort average complexity.tex b/d) Quicksort average complexity.tex
index 2241b2a..17c8043 100644
--- a/d) Quicksort average complexity.tex
+++ b/d) Quicksort average complexity.tex
...
\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}