this is for holding javascript data
Mazdak Farrokhzad edited a) Number of blits.tex
about 10 years ago
Commit id: 4e1257236608e0d6acddd776e85ff02319b87a8e
deletions | additions
diff --git a/a) Number of blits.tex b/a) Number of blits.tex
index d7c7344..cae674e 100644
--- a/a) Number of blits.tex
+++ b/a) Number of blits.tex
...
\section{Number of blits}
The number of blit operations can be expressed as:
\[T(n) = \begin{cases} 0, & n=1\\ 5 + 4 T(\frac{n}{2}), & n
\neq 2 > 1 \end{cases}\]
For $n = 2^x$ we try the algorithm for incremental sizes of $x$ to find a pattern for how the algorithm behaves.
\begin{subequations}