this is for holding javascript data
Niclas Alexandersson edited d) Quicksort average complexity.tex
about 10 years ago
Commit id: ba185372ceaf3a508621ecf7114a0362976768f5
deletions | additions
diff --git a/d) Quicksort average complexity.tex b/d) Quicksort average complexity.tex
index 310b613..c3a73d8 100644
--- a/d) Quicksort average complexity.tex
+++ b/d) Quicksort average complexity.tex
...
\Updownarrow\\
C(n) = \left(\prod_{k=0}^{n-1}\left[1+\frac{1}{k+1}\right]\right)\left(\frac{C(0)}{\prod_{k=0}^{-1}\left[1+\frac{1}{k+1}\right]} + \sum_{m=0}^{n-1}\left[\frac{2 - \frac{1}{m+1}}{\prod_{k=0}^{m}\left[1+\frac{1}{k+1}\right]}\right]\right)\\
\Updownarrow\\
C(n) = \left(n+1\right)\left(C(0) + \sum_{m=0}^{n-1}\left[\frac{2 -
\frac{1}{m+1}}{n+2}\right]\right)\\
\Updownarrow\\
C(n) = \left(n+1\right)\left(1 + \frac{2 - \frac{1}{m+1}}{n+2}\sum_{m=0}^{n-1}1\right)\\
\Updownarrow\\
C(n) = \left(n+1\right)\left(1 + \frac{2 - \frac{1}{m+1}}{n+2}n\right) \frac{1}{m+1}}{n+2}\right]\right)
\]