| radixsort.3 (129151) | radixsort.3 (131504) |
|---|---|
| 1.\" Copyright (c) 1990, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)radixsort.3 8.2 (Berkeley) 1/27/94 | 1.\" Copyright (c) 1990, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)radixsort.3 8.2 (Berkeley) 1/27/94 |
| 33.\" $FreeBSD: head/lib/libc/stdlib/radixsort.3 129151 2004-05-12 08:13:40Z ru $ | 33.\" $FreeBSD: head/lib/libc/stdlib/radixsort.3 131504 2004-07-02 23:52:20Z ru $ |
| 34.\" 35.Dd January 27, 1994 36.Dt RADIXSORT 3 37.Os 38.Sh NAME 39.Nm radixsort , sradixsort 40.Nd radix sort 41.Sh LIBRARY --- 58 unchanged lines hidden (view full) --- 100.Fa nmemb 101pointers. 102.Pp 103The 104.Fn radixsort 105function is not stable, but uses no additional memory. 106.Pp 107These functions are variants of most-significant-byte radix sorting; in | 34.\" 35.Dd January 27, 1994 36.Dt RADIXSORT 3 37.Os 38.Sh NAME 39.Nm radixsort , sradixsort 40.Nd radix sort 41.Sh LIBRARY --- 58 unchanged lines hidden (view full) --- 100.Fa nmemb 101pointers. 102.Pp 103The 104.Fn radixsort 105function is not stable, but uses no additional memory. 106.Pp 107These functions are variants of most-significant-byte radix sorting; in |
| 108particular, see D.E. Knuth's Algorithm R and section 5.2.5, exercise 10. | 108particular, see 109.An "D.E. Knuth" Ns 's 110.%T "Algorithm R" 111and section 5.2.5, exercise 10. |
| 109They take linear time relative to the number of bytes in the strings. 110.Sh RETURN VALUES 111.Rv -std radixsort 112.Sh ERRORS 113.Bl -tag -width Er 114.It Bq Er EINVAL 115The value of the 116.Fa endbyte --- 45 unchanged lines hidden --- | 112They take linear time relative to the number of bytes in the strings. 113.Sh RETURN VALUES 114.Rv -std radixsort 115.Sh ERRORS 116.Bl -tag -width Er 117.It Bq Er EINVAL 118The value of the 119.Fa endbyte --- 45 unchanged lines hidden --- |