Title: Gamasort, an improved Radix Sort Exchange Algorithm
Description: * This is a Radix Sort Exchange routine which will work only on * unsigned integers (unlike a general sorting function which * works based on comparisons). Since its complexity overhead * is pretty large, it is efficient on big array where the * maximum number is bounded by a relatively small ceiling. * E.g. a big array of bytes or shorts.
This file came from Planet-Source-Code.com...the home millions of lines of source code
You can view comments on this code/and or vote on it at: http://www.Planet-Source-Code.com/vb/scripts/ShowCode.asp?txtCodeId=4277&lngWId=3

The author may have retained certain copyrights to this code...please observe their request and the law by reviewing all copyright conditions at the above URL.