For all of you who have been keeping up with my recent coding activities, this is old news. But for the rest of you, if you are interested, I have now added a C version of my Radix sort (originally I had done this in Scheme), and I think you'll find it rather interesting. The code is almost exactly like the Scheme version, with the same idea in hand. The only difference is that it is iterative (meaning more complex logic to follow and variables to keep track of eck), and it uses ANSI standard C instead of Scheme.

It does not have the implicit type checking of Scheme, so you won't know what happens when your program all of a sudden bombs out on you; I have done very little input checking. I expect you to feed correct input into the program, not incorrect. The biggest thing is that you have to specify a valid integer number as the first argument to the program, and it has to be equal to the number of digits of each number of your list of numbers. Remember, Radix sorting only works if you have equal digits for each number. I will add the ability to not have this limitation later, I'm sure. It's a simple fix, but I don't want to do it right now. Now, in addition to this, the file you feed it must be a file containing integers all of the same length, one per line, and each line being ended with a 'n' character.

That's about it! I hope you all enjoy!

You can view my programs at my website