this is for holding javascript data
Mazdak Farrokhzad edited Complexity analysis.tex
over 10 years ago
Commit id: e72b215b11456dc1702aeb3f269bc0fbd4e6a618
deletions | additions
diff --git a/Complexity analysis.tex b/Complexity analysis.tex
index ce2c388..f41bc6b 100644
--- a/Complexity analysis.tex
+++ b/Complexity analysis.tex
...
These summation laws/formulas are used frequently.
They are very common and thus we won't prove any of them.
Most of them can be found
here: \href{http://en.wikipedia.org/wiki/Summation}{linktext} \href{http://en.wikipedia.org/wiki/Summation}{here}
\begin{enumerate}
\item $\displaystyle\sum_{n=s}^t C\cdot f(n) = C\cdot \sum_{n=s}^t f(n)$
\item $\displaystyle\sum_{i=m}^n 1 = n+1-m$
\item $\displaystyle\sum_{i=m}^n i = \frac{n(n+1)}{2} - \frac{m(m-1)}{2} = \frac{(n+1-m)(n+m)}{2}$
\end{enumerate}