deletions | additions       diff --git a/Version1.tex b/Version1.tex  index 0d9f229..1caca69 100644  --- a/Version1.tex  +++ b/Version1.tex 
...
\subsection{Version 1}  \\* \newline  \subsubsection{Rough estimate}  The 3 nested loops takes in worst case: $ne * nd * nc = n^3 * cde = kn^3$.  \textbf{Conclusion:} The algorithm computes with $\mathcal{O}(n^3)$ time complexity.  \\* \newline  \subsubsection{Mathematically correct estimate}  The mathematically correct estimate is represented by the function $T(n)$.