Computer Science
Intermediate

Linearithmic Time

Runtime of efficient comparison sorts.

Formula

O(nlog⁡n)O(n\log n)

Variables

nInput size

Example

Merge sort, heap sort

Did You Know?

The best comparison sorts run in n log n time, a limit no such algorithm can ever beat.

complexity