Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
The equation below is intuitively correct, but how do you show that this is actually the case? What is the working out needed?$$\sum_{i=1}^{n-1}O(lg n) = O(nlgn)$$
$$\sum_{i=1}^{n-1}O(\log n)=O(n\lg n)$$
The equation below is intuitively correct, but how do you show that this is actually the case? What is the working out needed?$$\sum_{i=1}^{n-1}O(lg n) = O(nlgn)$$
The equation below is intuitively correct, but how do you show that this is actually the case? What is the working out needed?
The equation below is intuitively correct, but how do you show that this is actually the case? What is the working out needed?
$$\sum_{i=1}^{n-1}O(lg n) = O(nlgn)$$
