It's well known that radix sort can be faster than comparison-based methods
for string sorting. With that in mind, I wrote this optimized version of
MSD radix sort:
https://github.com/yourbasic/radix
It's equivalent to sort.Strings in the standard library and on my machine
it's twice as fast as when sorting King James Bible and four times as fast
for the 1k benchmark in the sort package. Of course I can't promise similar
performance in other settings, but Go get it if you like.
Stefan
--
You received this message because you are subscribed to the Google Groups
"golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to golang-nuts+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
