about summary refs log tree commit diff
path: root/manual/search.texi
diff options
context:
space:
mode:
authorAndreas Jaeger <aj@suse.de>2000-05-23 06:37:29 +0000
committerAndreas Jaeger <aj@suse.de>2000-05-23 06:37:29 +0000
commit21ad6b26f4753d7128fc263448655f47aaaa2ec3 (patch)
treeb97f1f9e968d0d5cf451176610f739966240161f /manual/search.texi
parente513a8fd6ec9efe4212656472fd36841d823d8dd (diff)
downloadglibc-21ad6b26f4753d7128fc263448655f47aaaa2ec3.tar.gz
glibc-21ad6b26f4753d7128fc263448655f47aaaa2ec3.tar.xz
glibc-21ad6b26f4753d7128fc263448655f47aaaa2ec3.zip
Update.
2000-05-23  Andreas Jaeger  <aj@suse.de>

	* stdio-common/tfformat.c (sprint_doubles): Add testcase for %a.

	* manual/search.texi (Array Sort Function): Document that qsort is
	not necessarily in-place.

	* sunrpc/rpc_main.c (parseargs): Don't accept -M and -N.
	Closes PR libc/1731.

	* stdio-common/tfformat.c (sprint_doubles): Add testcase for %a.
Diffstat (limited to 'manual/search.texi')
-rw-r--r--manual/search.texi4
1 files changed, 4 insertions, 0 deletions
diff --git a/manual/search.texi b/manual/search.texi
index e45972c743..4da504cc9e 100644
--- a/manual/search.texi
+++ b/manual/search.texi
@@ -183,6 +183,10 @@ Functions}):
 
 The @code{qsort} function derives its name from the fact that it was
 originally implemented using the ``quick sort'' algorithm.
+
+The implementation of @code{qsort} in this library might not be an
+in-place sort and might thereby use an extra amount of memory to store
+the array.
 @end deftypefun
 
 @node Search/Sort Example