diff options
| author | Theo de Raadt <deraadt@cvs.openbsd.org> | 2001-10-29 18:10:50 +0000 |
|---|---|---|
| committer | Theo de Raadt <deraadt@cvs.openbsd.org> | 2001-10-29 18:10:50 +0000 |
| commit | a4c91db1c3dda758375581d05d8c7cc11b1b3dab (patch) | |
| tree | f30119916d9ed299503be353bede7e7be174f5ac /lib/libc/stdlib/qsort.3 | |
| parent | 1013843531e9cdda0ba65ce79f233a818eb61753 (diff) | |
fix docs; tedu@heorot.stanford.edu
Diffstat (limited to 'lib/libc/stdlib/qsort.3')
| -rw-r--r-- | lib/libc/stdlib/qsort.3 | 10 |
1 files changed, 3 insertions, 7 deletions
diff --git a/lib/libc/stdlib/qsort.3 b/lib/libc/stdlib/qsort.3 index 0eeb1159111..7b130c39842 100644 --- a/lib/libc/stdlib/qsort.3 +++ b/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 |