deletions | additions       diff --git a/Version1.tex b/Version1.tex  index 6b00d7b..7ac1394 100644  --- a/Version1.tex  +++ b/Version1.tex 
...
The 3 nested loops takes in worst case: $ne * nd * nc = n^3 * cde = kn^3$.  \textbf{Conclusion:} The algorithm computes with $O(n^3)$ $\mathcal{O}(n^3)$  time complexity. \subsubsection{Mathematically correct estimate}