From 7c24a87eca661c72eb9416b621e46aa3912aad35 Mon Sep 17 00:00:00 2001
From: deraadt <>
Date: Mon, 29 Oct 2001 18:10:49 +0000
Subject: [PATCH] fix docs; tedu@heorot.stanford.edu

---
 src/lib/libc/stdlib/qsort.3 | 10 +++-------
 1 file changed, 3 insertions(+), 7 deletions(-)

diff --git a/src/lib/libc/stdlib/qsort.3 b/src/lib/libc/stdlib/qsort.3
index 0eeb1159..7b130c39 100644
--- a/src/lib/libc/stdlib/qsort.3
+++ b/src/lib/libc/stdlib/qsort.3
@@ -33,7 +33,7 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: qsort.3,v 1.6 2000/08/09 15:51:21 aaron Exp $
+.\"	$OpenBSD: qsort.3,v 1.7 2001/10/29 18:10:49 deraadt Exp $
 .\"
 .Dd June 4, 1993
 .Dt QSORT 3
@@ -125,13 +125,9 @@ algorithm,
 a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H.
 .Fn heapsort
 takes O N lg N worst-case time.
-Its
-.Em only
-advantage over
+This implementation of
 .Fn qsort
-is that it uses almost no additional memory; while
-.Fn qsort
-does not allocate memory, it is implemented using recursion.
+is implemented without recursive function calls.
 .Pp
 The function
 .Fn mergesort