Average Case: O(n log (n))

Sorting algorithms with an average case performance of O(n log (n))

Algorithms

• Heapsort
• Merge Sort
• Quicksort

---

O(n log (n)) is the fastest average case performance possible for comparison sorting algorithms.