Mazdak Farrokhzad added Version3.tex  over 10 years ago

Commit id: 13e0dafb9bf96c8b54d05258b2a0a6e29b97d251

deletions | additions      

         

\subsection{2. Version 3}     \subsubsection{2.1. Rough estimate}     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)$ time complexity.     \subsubsection{2.2. Mathematically correct estimate}