deletions | additions       diff --git a/Complexity analysis.tex b/Complexity analysis.tex  index 8947317..d74279e 100644  --- a/Complexity analysis.tex  +++ b/Complexity analysis.tex 
...
\subsubsection{2.1. Rough estimate}  The 3 nested loops takes in worst case: $$ne $ne  * nd * nc = n^3 * cde = kn^3$$. kn^3$.  \textbf{Conclusion:} The algorithm computes with $O(n^3)$ time complexity.