I was just looking at some big $O$ time complexity notations given by wikipedia and I can say that $O(N\log N)$ has a quasi-linear time complexity, whereas $O(N)$ is obviously linear.
What I can say for sure is that $O(N^2\log N)$ is super-quadratic and sub-cubic.. but it is a long definition..
Would it be okay to generalize this calling $O(N^2\log N)$ as quasi-quadratic and similarly $N^3\log N$ as quasi-cubic? Please provide some references if its okay.