deletions | additions       diff --git a/Version 3.tex b/Version 3.tex  index abb1e4a..1be5827 100644  --- a/Version 3.tex  +++ b/Version 3.tex 
...
Gives the complexity function:  \begin{lstlisting}  Row T(n) = 1 + 1 1 + 2 2 + 3 (n+1)*2 + 4 n(turns) * 2 + extraTurn * 2 n * 1 + 5 n * 2 + 6 n * 2 + 7 n * 2 + 8 n * 2 + 9 n * 2 + 10 1 16 = 5 + 2(n+1) + 11n  = 7 + 13n \end{lstlisting}     $T(n) = 7 + 13n  = an exact solution $\in \in  \mathcal{O}(n)$\end{lstlisting}