For those of you looking for a faster way to sort files than the sometimes
cumbersome sort(1), here it is!  fastsort will sort input files in place,
using available memory.  It's at least twice as fast as sort(1), and it
doesn't use extra files in /usr/tmp.

fastsort is two-pass.  For those of you wondering why, look at qsort(3).
Anyone who knows of a better way, feel free to hack the source.

This is pretty much of a one-shot deal (no makefile, etc.), but if you want,
hack it up, whatever and re-post it.  Have fun!

-Ed

To compile:

	make fastsort
	strip fastsort

To run:

	fastsort files...
