Best Case: O(n log (n))

Sorting algorithms with a best case performance of Ω(n log (n))

Algorithms

• Heapsort
• Merge Sort
• Quicksort
• Shellsort

---

A best case of Ω(n log (n)) is a very close second to algorithms opperating at Ω(n). Though these algorithms are unable to opperate at Ω(n) in any case, they tend to have a more consistent opperating speed and less degredation.