diff options
Diffstat (limited to 'src/lib/libc/stdlib')
| -rw-r--r-- | src/lib/libc/stdlib/qsort.3 | 10 |
1 files changed, 3 insertions, 7 deletions
diff --git a/src/lib/libc/stdlib/qsort.3 b/src/lib/libc/stdlib/qsort.3 index 0eeb115911..7b130c3984 100644 --- a/src/lib/libc/stdlib/qsort.3 +++ b/src/lib/libc/stdlib/qsort.3 | |||
| @@ -33,7 +33,7 @@ | |||
| 33 | .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | 33 | .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 34 | .\" SUCH DAMAGE. | 34 | .\" SUCH DAMAGE. |
| 35 | .\" | 35 | .\" |
| 36 | .\" $OpenBSD: qsort.3,v 1.6 2000/08/09 15:51:21 aaron Exp $ | 36 | .\" $OpenBSD: qsort.3,v 1.7 2001/10/29 18:10:49 deraadt Exp $ |
| 37 | .\" | 37 | .\" |
| 38 | .Dd June 4, 1993 | 38 | .Dd June 4, 1993 |
| 39 | .Dt QSORT 3 | 39 | .Dt QSORT 3 |
| @@ -125,13 +125,9 @@ algorithm, | |||
| 125 | a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H. | 125 | a variant of selection sorting; in particular, see D.E. Knuth's Algorithm H. |
| 126 | .Fn heapsort | 126 | .Fn heapsort |
| 127 | takes O N lg N worst-case time. | 127 | takes O N lg N worst-case time. |
| 128 | Its | 128 | This implementation of |
| 129 | .Em only | ||
| 130 | advantage over | ||
| 131 | .Fn qsort | 129 | .Fn qsort |
| 132 | is that it uses almost no additional memory; while | 130 | is implemented without recursive function calls. |
| 133 | .Fn qsort | ||
| 134 | does not allocate memory, it is implemented using recursion. | ||
| 135 | .Pp | 131 | .Pp |
| 136 | The function | 132 | The function |
| 137 | .Fn mergesort | 133 | .Fn mergesort |
