I'm sure a lot of you have heard of them, and I looked into the complexities of writing one once, but never did actually do it.
Although, after reading only the first part of this (http://en.wikipedia.org/wiki/Radix_sort) article, I think I might be able to write one.
So, I thought I might post it. Maybe some code to come soon :)
That method of sorting is really cool and the article that you posted there explains it well.
The only working example I have seen applied to a demo-ish project was by Stonemonkey. I remember that he was experimenting with some sorts and did one in Yabasic and then took the Yabasic vectorbob record with it. It was very fast indeed.
I hope that you get one working, I'm sure that you'll be impressed with the speed.
Definitely worth looking into if you're going to be sorting a lot of objects. I'm still using a radix sort but not entirely sure what category from that wiki it would fall into.
First working sorter..
99,000 numbers sorted fast enough to do 21 times in a second..
That's great news!! :) And you posted the source too. Thanks BA!