--- Libc/Libc-763.13/stdlib/FreeBSD/qsort.3
+++ Libc/Libc-320/stdlib/FreeBSD/qsort.3
@@ -13,6 +13,10 @@
 .\" 2. Redistributions in binary form must reproduce the above copyright
 .\"    notice, this list of conditions and the following disclaimer in the
 .\"    documentation and/or other materials provided with the distribution.
+.\" 3. All advertising materials mentioning features or use of this software
+.\"    must display the following acknowledgement:
+.\"	This product includes software developed by the University of
+.\"	California, Berkeley and its contributors.
 .\" 4. 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.
@@ -30,9 +34,9 @@
 .\" SUCH DAMAGE.
 .\"
 .\"     @(#)qsort.3	8.1 (Berkeley) 6/4/93
-.\" $FreeBSD: src/lib/libc/stdlib/qsort.3,v 1.17 2007/01/09 00:28:10 imp Exp $
-.\"
-.Dd September 30, 2003
+.\" $FreeBSD: src/lib/libc/stdlib/qsort.3,v 1.13 2002/12/18 12:45:10 ru Exp $
+.\"
+.Dd September 7, 2002
 .Dt QSORT 3
 .Os
 .Sh NAME
@@ -145,13 +149,11 @@
 .Fn qsort
 and
 .Fn qsort_r
-functions are an implementation of C.A.R.
-Hoare's
+functions are an implementation of C.A.R. Hoare's
 .Dq quicksort
 algorithm,
-a variant of partition-exchange sorting; in particular, see
-.An D.E. Knuth Ns 's
-.%T "Algorithm Q" .
+a variant of partition-exchange sorting; in particular, see D.E. Knuth's
+Algorithm Q.
 .Sy Quicksort
 takes O N lg N average time.
 This implementation uses median selection to avoid its
@@ -159,13 +161,10 @@
 .Pp
 The
 .Fn heapsort
-function is an implementation of
-.An "J.W.J. William" Ns 's
+function is an implementation of J.W.J. William's
 .Dq heapsort
 algorithm,
-a variant of selection sorting; in particular, see
-.An "D.E. Knuth" Ns 's
-.%T "Algorithm H" .
+a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H.
 .Sy Heapsort
 takes O N lg N worst-case time.
 Its
@@ -205,37 +204,37 @@
 return no value.
 .Pp
 .Rv -std heapsort mergesort
+.Sh ERRORS
+The
+.Fn heapsort
+and
+.Fn mergesort
+functions succeed unless:
+.Bl -tag -width Er
+.It Bq Er EINVAL
+The
+.Fa size
+argument is zero, or,
+the
+.Fa size
+argument to
+.Fn mergesort
+is less than
+.Dq "sizeof(void *) / 2" .
+.It Bq Er ENOMEM
+The
+.Fn heapsort
+or
+.Fn mergesort
+functions
+were unable to allocate memory.
+.El
 .Sh COMPATIBILITY
 Previous versions of
 .Fn qsort
 did not permit the comparison routine itself to call
 .Fn qsort 3 .
 This is no longer true.
-.Sh ERRORS
-The
-.Fn heapsort
-and
-.Fn mergesort
-functions succeed unless:
-.Bl -tag -width Er
-.It Bq Er EINVAL
-The
-.Fa size
-argument is zero, or,
-the
-.Fa size
-argument to
-.Fn mergesort
-is less than
-.Dq "sizeof(void *) / 2" .
-.It Bq Er ENOMEM
-The
-.Fn heapsort
-or
-.Fn mergesort
-functions
-were unable to allocate memory.
-.El
 .Sh SEE ALSO
 .Xr sort 1 ,
 .Xr radixsort 3
@@ -264,19 +263,16 @@
 .%P pp. 114-123, 145-149
 .Re
 .Rs
-.%A McIlroy, P.M.
+.%A Mcilroy, P.M.
 .%T "Optimistic Sorting and Information Theoretic Complexity"
 .%J "Fourth Annual ACM-SIAM Symposium on Discrete Algorithms"
 .%V January 1992
 .Re
 .Rs
 .%A Bentley, J.L.
-.%A McIlroy, M.D.
 .%T "Engineering a Sort Function"
-.%J "Software--Practice and Experience"
-.%V Vol. 23(11)
-.%P pp. 1249-1265
-.%D November\ 1993
+.%J "bentley@research.att.com"
+.%V January 1992
 .Re
 .Sh STANDARDS
 The