From a6347b2b07d039d01a04b22538220a7c6d7697b3 Mon Sep 17 00:00:00 2001
From: jmc <>
Date: Sun, 7 Sep 2003 18:57:05 +0000
Subject: typos from Brian Poole; ok deraadt@

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

(limited to 'src/lib/libc/stdlib/qsort.3')

diff --git a/src/lib/libc/stdlib/qsort.3 b/src/lib/libc/stdlib/qsort.3
index 2921cbbe69..0af8606773 100644
--- a/src/lib/libc/stdlib/qsort.3
+++ b/src/lib/libc/stdlib/qsort.3
@@ -29,7 +29,7 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: qsort.3,v 1.12 2003/06/02 20:18:38 millert Exp $
+.\"	$OpenBSD: qsort.3,v 1.13 2003/09/07 18:57:05 jmc Exp $
 .\"
 .Dd June 4, 1993
 .Dt QSORT 3
@@ -122,7 +122,7 @@ a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H.
 .Fn heapsort
 takes O N lg N worst-case time.
 This implementation of
-.Fn qsort
+.Fn heapsort
 is implemented without recursive function calls.
 .Pp
 The function
-- 
cgit v1.2.3-55-g6feb