O(n log n) Linearithmic
← Back to Common Classes
Linearithmic time complexity. Characteristic of efficient comparison-based sorting algorithms (merge sort, heapsort) and divide-and-conquer algorithms. The theoretical lower bound for comparison-based sorting.