Mazdak Farrokhzad edited c) Imposing a restriction.tex  about 10 years ago

Commit id: c97826b341469901c915ce31bd4403ac694e0521

deletions | additions      

       

\end{algorithmic}  \end{algorithm}  The number of calls, which will be our elementary operation and thus the time complexity, can be visualized and divided into two "geometric" shapes, one triangle shaped phase where with the complexity being the "area" given by the value: $A_2 = \sum_{k=1}^{g(x)}\left[2(k - 1)]\right]. 1)]\right]$.