In terms of complexity, linearithmic is ω(n), O(n^{2}) and Θ(nlogn), or in other words, linearithmic grows faster than a linear term, and slower than a quadratic term.

Some famous algorithms that are in linearithmic time include: