1 .\" Copyright (c) 1990, 1991, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" Redistribution and use in source and binary forms, with or without
5 .\" modification, are permitted provided that the following conditions
7 .\" 1. Redistributions of source code must retain the above copyright
8 .\" notice, this list of conditions and the following disclaimer.
9 .\" 2. Redistributions in binary form must reproduce the above copyright
10 .\" notice, this list of conditions and the following disclaimer in the
11 .\" documentation and/or other materials provided with the distribution.
12 .\" 4. Neither the name of the University nor the names of its contributors
13 .\" may be used to endorse or promote products derived from this software
14 .\" without specific prior written permission.
16 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
17 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
20 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 .\" @(#)radixsort.3 8.2 (Berkeley) 1/27/94
29 .\" $FreeBSD: src/lib/libc/stdlib/radixsort.3,v 1.12 2007/01/09 00:28:10 imp Exp $
30 .\" $DragonFly: src/lib/libc/stdlib/radixsort.3,v 1.2 2003/06/17 04:26:46 dillon Exp $
45 .Fn radixsort "const unsigned char **base" "int nmemb" "const unsigned char *table" "unsigned endbyte"
47 .Fn sradixsort "const unsigned char **base" "int nmemb" "const unsigned char *table" "unsigned endbyte"
54 are implementations of radix sort.
56 These functions sort an array of pointers to byte strings, the initial
57 member of which is referenced by
59 The byte strings may contain any values; the end of each string
60 is denoted by the user-specified value
63 Applications may specify a sort order by providing the
69 must reference an array of
71 + 1 bytes which contains the sort
72 weight of each possible byte value.
73 The end-of-string byte must have a sort weight of 0 or 255
74 (for sorting in reverse order).
75 More than one byte may have the same sort weight.
79 is useful for applications which wish to sort different characters
80 equally, for example, providing a table with the same weights
81 for A-Z as for a-z will result in a case-insensitive sort.
84 is NULL, the contents of the array are sorted in ascending order
87 order of the byte strings they reference and
89 has a sorting weight of 0.
93 function is stable, that is, if two elements compare as equal, their
94 order in the sorted array is unchanged.
97 function uses additional memory sufficient to hold
103 function is not stable, but uses no additional memory.
105 These functions are variants of most-significant-byte radix sorting; in
107 .An "D.E. Knuth" Ns 's
109 and section 5.2.5, exercise 10.
110 They take linear time relative to the number of bytes in the strings.
128 for any of the errors specified for the library routine
136 .%B "The Art of Computer Programming"
137 .%T "Sorting and Searching"
144 .%T "Three Partition Refinement Algorithms"
145 .%J "SIAM J. Comput."
152 .%B "Engineering Radix Sort"
153 .%T "Computing Systems"
160 function first appeared in