this is for holding javascript data
Mazdak Farrokhzad edited a) Number of blits.tex
about 10 years ago
Commit id: 67f8f502085683a9fcf3244fa793e376372a24a0
deletions | additions
diff --git a/a) Number of blits.tex b/a) Number of blits.tex
index b76d38b..68151f3 100644
--- a/a) Number of blits.tex
+++ b/a) Number of blits.tex
...
\section{Number of blits}
The recursive algorithm can be expressed as having the cost:
$f(n) = \begin{cases} 5, & n=2 \\
3n+1, 5 + 4 T(n / 2), & \mbox{if } n\mbox{ is odd} \end{cases}$
\[T(n) &= \left{(n = 2) ? 5 : 5 + 4 T(n / 2)\]
\[f(n) &= \begin{cases} 5, & n = 2\\ 5 + 4 T(n / 2), & n \not 2\end{cases}\]