From 2476875a0e7bade78eae47e7f44dbf4f5de3a7fc Mon Sep 17 00:00:00 2001
From: millert <>
Date: Sat, 20 May 2017 13:09:01 +0000
Subject: [PATCH] Document that qsort falls back to heapsort() if the recursion
 depth exceeds 2 lg N and add a reference to the introsort paper.

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

diff --git a/src/lib/libc/stdlib/qsort.3 b/src/lib/libc/stdlib/qsort.3
index f7537777..29a29f3a 100644
--- a/src/lib/libc/stdlib/qsort.3
+++ b/src/lib/libc/stdlib/qsort.3
@@ -29,9 +29,9 @@
 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 .\" SUCH DAMAGE.
 .\"
-.\"	$OpenBSD: qsort.3,v 1.19 2016/03/12 21:31:22 mmcc Exp $
+.\"	$OpenBSD: qsort.3,v 1.20 2017/05/20 13:09:01 millert Exp $
 .\"
-.Dd $Mdocdate: March 12 2016 $
+.Dd $Mdocdate: May 20 2017 $
 .Dt QSORT 3
 .Os
 .Sh NAME
@@ -111,7 +111,9 @@ Algorithm Q.
 .Fn qsort
 takes O N lg N average time.
 This implementation uses median selection to avoid its
-O N**2 worst-case behavior.
+O N**2 worst-case behavior and will fall back to
+.Fn heapsort
+if the recursion depth exceeds 2 lg N.
 .Pp
 The
 .Fn heapsort
@@ -209,6 +211,14 @@ were unable to allocate memory.
 .%P pp. 1249\-1265
 .%D November 1993
 .Re
+.Rs
+.%A Musser, D.
+.%T "Introspective Sorting and Selection Algorithms"
+.%J "Software \- Practice and Experience"
+.%V Vol. 27(8)
+.%P pp. 983\-993
+.%D August 1997
+.Re
 .Sh STANDARDS
 Previous versions of
 .Fn qsort