# Can Any Sort Go Faster? The n log n Speed Limit

Know whether a faster sort can exist before you hunt for one: why a faster machine, a tweaked quicksort or a cleverer comparison can't beat O(n log n) for a sort that compares, and the one kind of data where you can.

![Cheat sheet: Can Any Sort Go Faster? The n log n Speed Limit](https://fsdtrainingmedia.blob.core.windows.net/public/images/2026/11/6b9f6685277d4c379aec9cfd900171b5.webp)

- Category: Data Structures
- Level: Freelancer
- Tags: Comparison Sort, data structures, Linearithmic Time, Logarithm, Lower Bound
- Updated: November 3, 2026

Source: https://www.ask-codey.com/cheat-sheets/ds-sorting-speed-limit-cheat-sheet