this is for holding javascript data
Mazdak Farrokhzad edited d) Quicksort average complexity.tex
about 10 years ago
Commit id: 32c8917d1c2b9b735b49968afd979cd5ddd8bc1b
deletions | additions
diff --git a/d) Quicksort average complexity.tex b/d) Quicksort average complexity.tex
index a1c1b30..fd6d71d 100644
--- a/d) Quicksort average complexity.tex
+++ b/d) Quicksort average complexity.tex
...
\Updownarrow\\
C(n) = \left(n+1\right)\left(C(0) + \sum_{m=0}^{n-1}\left[\frac{2 - \frac{1}{m+1}}{m+2}\right]\right)\\
\Updownarrow\\
(n+1)\left(C(0) + \sum_{m=0}^{n-1}\left[\frac{3}{m+2} -
\frac{1}{m+1}\right]\right) \frac{1}{m+1}\right]\right)\\
\Updownarrow\\
(n+1)\left(C(0) + \sum_{m=0}^{n-1}\left[\frac{3}{m+2}\right] - \sum_{m=0}^{n-1}\left[\frac{1}{m+1}\right]\right)\\
\]