are implementations of radix sort.
These functions sort an array of pointers to byte strings, the initial
member of which is referenced by
The byte strings may contain any values; the end of each string
is denoted by the user-specified value
Applications may specify a sort order by providing the
must reference an array of
+ 1 bytes which contains the sort
weight of each possible byte value.
The end-of-string byte must have a sort weight of 0 or 255
(for sorting in reverse order).
More than one byte may have the same sort weight.
is useful for applications which wish to sort different characters
equally, for example, providing a table with the same weights
for A-Z as for a-z will result in a case-insensitive sort.
is NULL, the contents of the array are sorted in ascending order
according to the
order of the byte strings they reference and
has a sorting weight of 0.
function is stable, that is, if two elements compare as equal, their
order in the sorted array is unchanged.
function uses additional memory sufficient to hold
function is not stable, but uses no additional memory.
These functions are variants of most-significant-byte radix sorting; in
.An D.E. Knuth Ns s
and section 5.2.5, exercise 10.
They take linear time relative to the number of bytes in the strings.