Skip to main content
2 of 6
refine style
OmG
  • 3.6k
  • 1
  • 14
  • 23

In order to compare 2 complexities just calculate a limit of their ratios as below (here we use L'Hôpital's rule to simplify calculating a limit for $\frac{\ln(k)}{k}$:

enter image description here

As you can see, $O(n^2\times\log(n))$ is lower than the other.

Anatolii
  • 261
  • 1
  • 6