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.

Updated

Cheat sheet: Can Any Sort Go Faster? The n log n Speed Limit
Category
Data Structures
Level
Freelancer
Tags
Comparison Sort, data structures, Linearithmic Time, Logarithm, Lower Bound