this is for holding javascript data
Niclas Alexandersson edited d) Quicksort average complexity.tex
about 10 years ago
Commit id: 050ac1afe91517f46790f08ae6d56d3c270ce4be
deletions | additions
diff --git a/d) Quicksort average complexity.tex b/d) Quicksort average complexity.tex
index b4de91e..a2606cc 100644
--- a/d) Quicksort average complexity.tex
+++ b/d) Quicksort average complexity.tex
...
\Updownarrow\\
C(n) = (n+1)\left(C(0) + 2H_n - 3 + \frac{3}{n+1}\right)\\
\Updownarrow\\
C(n) = (n+1)2H_n
+ - 2(n+1) -
1\\ 3\\
\]