Xavier Holt edited begin_claim_The_algorithm_runs__.tex  about 8 years ago

Commit id: 3e733804d6ba59492d218af42bc0d048ff3b34fb

deletions | additions      

       

&= O(n\log n) + n^{\log 2}O(1) + \sum_{j=0}^{\log n-1} 2^j (\log n - \log{2^j}) \\   &= O(n\log n) + O(n) + \left(\log n\sum_{j=0}^{\log n-1} 2^j - \sum_{j=0}^{\log n-1} 2^j\log{2^j} \right)\\   &= O(n\log n) + \left(\log n \times 2^{\log n} - C \right) &\text{with $C\geq0$}\\  &= O(n\log n) + \left(n\log n - C \right) &\comment{inner &\tag{inner  bracket $\geq 0$} \\ \end{eqnarray}  \end{proof}