Encyclopedia > Linearithmic

Article Content

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

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Thomas a Kempis

... mass of mankind, who can not be recluses, are called. The charge has even been made that the piety commended by the "Imitation" is of a selfish monkish type. It ...