Search code examples
time-complexitybig-o

difference between these Time complexity

what is difference between O(N Log^2N) and O(N LogLogN) time complexity?

I can't understand whats the difference?

Solution

  • The first one means squaring the log of n. The second means taking the log of the log of n, i.e.

    O( n * log(n) * log(n) )

    vs.

    O( n * log(log(n)) )