Jump to content

Linearithmic function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 22:02, 20 July 2003 (A dog is NOT a "term that refers to" an animal. I don't know why so MANY otherwise intelligently written articles here say that.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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(n2) 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: