Sidewinder Sort – 2 to 3 times faster than PB sort
This is a Trie/Bucket sort
About 2.4 times faster than PB sort.
Over 3 times faster for string > 200 characters.
The longer the strings, the wider the spread.
Note: this is purely for those who like to play around with sort algorithms.
On 100,000 strings, you’ll save a fraction of a second.
This is a slight improvement over the “slot sort” I posted before.
(same sort with a little tuning)
The Burst Sort used to be the champ.
It was about twice as fast as the Quick Sort.
There are now variations of the Burst Sort that are 4 to 5 times faster than Quick Sort.
These sorts are also Trie based.
They are very complex sorts that focus on keeping the work in the CPU cache.
http://www.cs.mu.oz.au/~rsinha/paper...Zobel-2006.pdf
This sort uses recursive calls to build a Trie tree on the program stack.
I had a request for information on how to convert it to an UCase sort.
I tried, but couldn’t do it.
Public domain – use at your own risk
.
This is a Trie/Bucket sort
About 2.4 times faster than PB sort.
Over 3 times faster for string > 200 characters.
The longer the strings, the wider the spread.
Note: this is purely for those who like to play around with sort algorithms.
On 100,000 strings, you’ll save a fraction of a second.
This is a slight improvement over the “slot sort” I posted before.
(same sort with a little tuning)
The Burst Sort used to be the champ.
It was about twice as fast as the Quick Sort.
There are now variations of the Burst Sort that are 4 to 5 times faster than Quick Sort.
These sorts are also Trie based.
They are very complex sorts that focus on keeping the work in the CPU cache.
http://www.cs.mu.oz.au/~rsinha/paper...Zobel-2006.pdf
This sort uses recursive calls to build a Trie tree on the program stack.
I had a request for information on how to convert it to an UCase sort.
I tried, but couldn’t do it.
Public domain – use at your own risk
.
Comment