Mazdak Farrokhzad edited a) Complexity.tex  about 10 years ago

Commit id: fd21743e41bf50042391682356dc2172c0ea0ad8

deletions | additions      

       

\begin{subequations}  \begin{align*}  C(0) &= 1\\  C(n) &= c + \sum_{i = 0}^{n-1} C(i)\\  &= C(i) =  c + \sum_{i = 0}^{n-2} C(i) + C(n-1)\\ &= 2(c + \sum_{i = 0}^{n-1} C(i))\\  C(n-1) &= c + \sum_{i = 0}^{n-2} C(i)\\  C(n) &= 2(c + \sum_{i = 0}^{n-2} C(i))\\  &= C(i)) =  2C(n-1) \end{align*}  \end{subequations}