deletions | additions       diff --git a/c) Imposing a restriction.tex b/c) Imposing a restriction.tex  index a5cf130..f3d791c 100644  --- a/c) Imposing a restriction.tex  +++ b/c) Imposing a restriction.tex 
...
\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 = \displaystyle\sum_{k=1}^{g(x)}\left[2(k $A_1$  \begin{subequations}  \begin{align*}  A_1 &= \sum_{k=1}^{g(x)}\left[2(k  - 1)]\right]$. 1)]\right]\\  A_2 &=   \end{align*}  \end{subequations}