| qsort.3 (73088) | qsort.3 (79754) |
|---|---|
| 1.\" Copyright (c) 1990, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" the American National Standards Committee X3, on Information 6.\" Processing Systems. 7.\" 8.\" Redistribution and use in source and binary forms, with or without --- 20 unchanged lines hidden (view full) --- 29.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34.\" SUCH DAMAGE. 35.\" 36.\" @(#)qsort.3 8.1 (Berkeley) 6/4/93 | 1.\" Copyright (c) 1990, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" the American National Standards Committee X3, on Information 6.\" Processing Systems. 7.\" 8.\" Redistribution and use in source and binary forms, with or without --- 20 unchanged lines hidden (view full) --- 29.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34.\" SUCH DAMAGE. 35.\" 36.\" @(#)qsort.3 8.1 (Berkeley) 6/4/93 |
| 37.\" $FreeBSD: head/lib/libc/stdlib/qsort.3 73088 2001-02-26 13:23:47Z ru $ | 37.\" $FreeBSD: head/lib/libc/stdlib/qsort.3 79754 2001-07-15 07:53:42Z dd $ |
| 38.\" 39.Dd June 4, 1993 40.Dt QSORT 3 41.Os 42.Sh NAME 43.Nm qsort , heapsort , mergesort 44.Nd sort functions 45.Sh LIBRARY --- 83 unchanged lines hidden (view full) --- 129is that it uses almost no additional memory; while 130.Fn qsort 131does not allocate memory, it is implemented using recursion. 132.Pp 133The function 134.Fn mergesort 135requires additional memory of size 136.Fa nmemb * | 38.\" 39.Dd June 4, 1993 40.Dt QSORT 3 41.Os 42.Sh NAME 43.Nm qsort , heapsort , mergesort 44.Nd sort functions 45.Sh LIBRARY --- 83 unchanged lines hidden (view full) --- 129is that it uses almost no additional memory; while 130.Fn qsort 131does not allocate memory, it is implemented using recursion. 132.Pp 133The function 134.Fn mergesort 135requires additional memory of size 136.Fa nmemb * |
| 137.Fa size | 137.Fa size |
| 138bytes; it should be used only when space is not at a premium. 139.Fn Mergesort 140is optimized for data with pre-existing order; its worst case 141time is O N lg N; its best case is O N. 142.Pp 143Normally, 144.Fn qsort 145is faster than --- 93 unchanged lines hidden --- | 138bytes; it should be used only when space is not at a premium. 139.Fn Mergesort 140is optimized for data with pre-existing order; its worst case 141time is O N lg N; its best case is O N. 142.Pp 143Normally, 144.Fn qsort 145is faster than --- 93 unchanged lines hidden --- |