Mazdak Farrokhzad edited a) As few classrooms as possible.tex  almost 10 years ago

Commit id: 4239e41a204a78ad6ab866ccbb9cfdb525a92795

deletions | additions      

       

\begin{align*}  T(n) &= c_0 + n\log{n} + \sum_{i=1}^{n-1} \left[ c_1 + \log{i} + \sum_{j=1}^i \Big[ c_2 \Big] \right]  + 1 \left[ c_1 + \sum_{i=1}^{n-1} \Big[ \log{i} \Big] + \log{1} \right]\\  &= c_0 + \log{1} +  n\log{n} + \sum_{i=1}^{n-1} \left[ c_1 + \log{i} + c_2i \right] + \left[ c_1 + \sum_{i=1}^{n-1} \Big[ \log{i} \Big]+ \log{1}  \right]\\ &= c_0 + n\log{n} + nc_1 + \sum_{i=1}^{n-1} \Big[ \log{i} + c_2i \Big]  + \left[ \sum_{i=1}^{n-1} \Big[ \log{i} \Big] + \log{1} \right]\\  \end{align*}