Gamasort, an improved Radix Sort Exchange Algorithm

* 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.