News for hackers. Stuff that matters.
Re:Writing a Faster Sorting Algorithm by martincmartin on Tuesday January 03, 2017 @10:40AM (#13309812)
Radix sort (and its variant trie sort) are the biggest ones:

https://en.wikipedia.org/wiki/Radix_sort

The O(n log n) lower bound is only for comparison based sorts. If you don't take a comparison function, but instead look at the internal structure, you can do better, but of course that depends on that internal structure and what order you want them in.

There are no comments on this comment yet.