 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
In computer science, a function is called linearithmic if it is of the form n · log n (i.e., a product of a linear and a logarithmic term.)
In terms of complexity, linearithmic is ω(n), O(n2), and Θ(n · log n). Thus, a linearithmic term grows faster than a linear term but slower than a quadratic term.
Some famous algorithms that run in linearithmic time include:
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
