Niclas Alexandersson edited a) As few classrooms as possible.tex  almost 10 years ago

Commit id: 7ba20ba414bb60aac3622758a071368086a20656

deletions | additions      

       

\begin{subequations}  \begin{align*}  T(n) &= c_0 + n\log{n} + (n-1) (c_1 + \log{n}) + n (c_2 + \log{n})\\  &= 3n\log{n} + n c_1 (c_1  + n c_2 c_2)  - \log{n} + c_0 - c_1\\ &\in \ordo{n\log{n}}  \end{align*}  \end{subequations}