Web Guide: Encyclopedia

Linearithmic

In computer science, Linearithmic is a term that refers to functions 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

Elsewhere

Search engine
Web directory