n^2 log n complexity

big-o, time-complexity

Solution

If that's the time-complexity of the algorithm, then it is in big-O notation already, so, yes, keep the log. Asymptotically, there is a difference between `O(n^2)` and `O((n^2)*log(n))`.

Problem

I am just a bit confused. If time complexity of an algorithm is given by what is that in big O notation? Just or we keep the log?

Original source