Radix sort is very fast algorithm for sorting small values using an integral
or floating point key. Sizes of 4 or 8 bytes are ideal. Bigger ones get
progressively slower as radix sort have to move every value same number of
times as number of bytes in the sorting key.
The result is guaranteed to be written in the array passed as the first argument.
Sort array using radix sort.
Radix sort is very fast algorithm for sorting small values using an integral or floating point key. Sizes of 4 or 8 bytes are ideal. Bigger ones get progressively slower as radix sort have to move every value same number of times as number of bytes in the sorting key.
The result is guaranteed to be written in the array passed as the first argument.