deletions | additions       diff --git a/b) Complexity.tex b/b) Complexity.tex  index cb89516..2041e09 100644  --- a/b) Complexity.tex  +++ b/b) Complexity.tex 
...
\section{Complexity}  We are given that the runtime complexity of a single blit operation for a section of dimentions $n\cdot n$, is $\mathcal{O}(n^2)$. Given this information, the runtime complexity of the rotation algorithm can be expressed as:   \[T(n) = \begin{cases} 0, & n=1\\ 5 * (\frac{n}{2})^2 + 4 T(\frac{n}{2}), & n > 1 \end{cases}\]  \begin{verbatim}  B(n) = n^2