BSD 4_3_Reno release

[unix-history] / usr / src / lib / libc / stdlib / qsort.3

diff --git a/usr/src/lib/libc/stdlib/qsort.3 b/usr/src/lib/libc/stdlib/qsort.3
index 132571b..1f35ae8 100644 (file)
--- a/usr/src/lib/libc/stdlib/qsort.3
+++ b/usr/src/lib/libc/stdlib/qsort.3
@@ -1,11 +1,23 @@
 .\" Copyright (c) 1990 The Regents of the University of California.
 .\" All rights reserved.
 .\"
 .\" Copyright (c) 1990 The Regents of the University of California.
 .\" All rights reserved.
 .\"

-.\" %sccs.include.redist.man%
+.\" Redistribution and use in source and binary forms are permitted
+.\" provided that: (1) source distributions retain this entire copyright
+.\" notice and comment, and (2) distributions including binaries display
+.\" the following acknowledgement:  ``This product includes software
+.\" developed by the University of California, Berkeley and its contributors''
+.\" in the documentation or other materials provided with the distribution
+.\" and in all advertising materials mentioning features or use of this
+.\" software. Neither the name of the University nor the names of its
+.\" contributors may be used to endorse or promote products derived
+.\" from this software without specific prior written permission.
+.\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+.\" IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+.\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.

 .\"
 .\"

-.\"    @(#)qsort.3     6.4 (Berkeley) %G%
+.\"    @(#)qsort.3     6.3 (Berkeley) 5/16/90

 .\"
 .\"

-.TH QSORT 3  ""
+.TH QSORT 3  "May 16, 1990"

 .UC 4
 .SH NAME
 qsort \- quicker sort
 .UC 4
 .SH NAME
 qsort \- quicker sort


@@ -16,16 +28,12 @@ qsort \- quicker sort
 
 void
 qsort(void *base, size_t nmemb, size_t size,
 
 void
 qsort(void *base, size_t nmemb, size_t size,

-.RS
-.\" have to reset bold font
-.ft B

 int (*compar)(const void *, const void *));
 int (*compar)(const void *, const void *));

-.RE

 .ft R
 .fi
 .SH DESCRIPTION
 .I Qsort
 .ft R
 .fi
 .SH DESCRIPTION
 .I Qsort

-is a modified partition-exchange sort, or quicksort.
+is an implementation of C.A.R. Hoare's ``quicksort'' algorithm.

 .PP
 The
 .I qsort 
 .PP
 The
 .I qsort 


@@ -46,33 +54,13 @@ The comparison function must return an integer less than, equal to, or
 greater than zero if the first argument is considered to be respectively
 less than, equal to, or greater than the second.
 .PP
 greater than zero if the first argument is considered to be respectively
 less than, equal to, or greater than the second.
 .PP

-.I Qsort
-is
-.B not
-stable, that is, if two members compare as equal, their order in
-the sorted array is undefined.
-.PP
-.I Qsort
-is an implementation of C.A.R. Hoare's ``quicksort'' algorithm, a variant
-of partition-exchange sorting; in particular, see D.E. Knuth's Algorithm Q.
-.I Qsort
-takes O N lg N average time.
-.SH "RETURN VALUES"
-.I Qsort 
-returns no value.
-.SH COMPATIBILITY
-Previous versions of
-.I qsort
-did not permit the comparison routine to itself call
-.IR qsort (3).
-This is no longer true.
+If two members compare as equal, their order in the sorted array is
+undefined.

 .SH "SEE ALSO"
 .SH "SEE ALSO"

-sort(1), radixsort(3)
-.sp
-Hoare, C.A.R. [1962]. "Quicksort", The Computer Journal, 5:1, pp. 10-15.
-.br
-Knuth, D.E. [1968]. "The Art of Computer Programming Vol. 3: Sorting and
-Searching", pp. 114-123.
+sort(1)

 .SH STANDARDS
 .SH STANDARDS

-.I Qsort
+.B Qsort

 conforms to ANSI X3.159-1989 (``ANSI C'').
 conforms to ANSI X3.159-1989 (``ANSI C'').

+.SH BUGS
+The comparison routine may not itself call
+.IR qsort (3).