this is for holding javascript data
Niclas Alexandersson edited d) Quicksort average complexity.tex
about 10 years ago
Commit id: a32d4ecf8fbd56465e06287081fd610406eb1fe5
deletions | additions
diff --git a/d) Quicksort average complexity.tex b/d) Quicksort average complexity.tex
index 7b88747..19c7883 100644
--- a/d) Quicksort average complexity.tex
+++ b/d) Quicksort average complexity.tex
...
This gives us that:
\[
C(n+1)=(1 + \frac{1}{n+1})C(n) + 2 -
\frac{1}{n+1}\
\Updownarrow\ \frac{1}{n+1}\\
\Updownarrow\\
C(n+1)=(1 + \frac{1}{n+1})C(n) + 2 - \frac{1}{n+1}
\]