Linearithmic

In computer science, a linearithmic function is a function of the form n log n, a product of a linear and logarithmic term.

In terms of complexity, linearithmic is ω(n), O(n²) 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:

• Average time quicksort
• The fast Fourier transform
• Monge array calculation