I have devised a "fun" coding challenge: to make a sorting algorithm using the fewest characters possible. This will be measured by the size of the algorithm file. The rules: the algorithm must be an in-place sort, O(n log n) average case (no bubble-sort), and must make no function calls.
The language is pure c (although if you use another language, it will be considered). "sort.c" is the test harness, which includes "sort.inc" as the actual sorting algorithm. For your algorithm, 'a' is an array of ints to be sorted, and 'n' is the size of 'a'. I've tested my code with gcc.
I've already made an algorithm I am happy with, so I'll judge it against any other entries I get. Final day for submission will be Sunday, June 29th. Happy hacking!