News for hackers. Stuff that matters.
Re:Writing a Faster Sorting Algorithm by dancodes on Tuesday January 03, 2017 @10:33AM (#13309756)
Do you know of any resource which details these faster algorithms when given extra requirements?
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.