this is for holding javascript data
Mazdak Farrokhzad edited d) Quicksort average complexity.tex
about 10 years ago
Commit id: 86ce0b48c15b6b1ebc18d5b226de185a4e9d91db
deletions | additions
diff --git a/d) Quicksort average complexity.tex b/d) Quicksort average complexity.tex
index 49783b7..c4dac7d 100644
--- a/d) Quicksort average complexity.tex
+++ b/d) Quicksort average complexity.tex
...
We know that: \[(n-x)C(n-x) = 2 \sum_{i=0}^{n-1-x} \left[C(i)\right] + n^2 + x^2 - 2nx\]
We compute $nC(n)$ and
$(n-1)