--- Libc/Libc-498/stdlib/FreeBSD/qsort.3
+++ Libc/Libc-320/stdlib/FreeBSD/qsort.3
@@ -34,9 +34,9 @@
 .\" SUCH DAMAGE.
 .\"
 .\"     @(#)qsort.3	8.1 (Berkeley) 6/4/93
-.\" $FreeBSD: src/lib/libc/stdlib/qsort.3,v 1.15 2004/07/02 23:52:12 ru 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
@@ -149,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
@@ -163,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
@@ -268,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