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

Commit id: eb4ce6b6b3167c27e515418347e3217904373a14

deletions | additions      

       

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