summaryrefslogtreecommitdiff
path: root/ChangeLog
diff options
context:
space:
mode:
authorAnders Kaseorg <andersk@MIT.EDU>2014-07-02 21:17:50 -0400
committerOndřej Bílka <neleai@seznam.cz>2014-12-10 16:24:44 +0100
commitf5f46d51f75083e27fae79cee6cd7707888faba3 (patch)
tree5a31623e034dfa63c27d713ec8b189e380cde710 /ChangeLog
parentb987c89126b84b06c22b13c2827499bc9d9e5e88 (diff)
downloadglibc-f5f46d51f75083e27fae79cee6cd7707888faba3.tar.gz
manual: Remove incorrect claim that qsort() can be stabilized
Under certain conditions on the size of the array and its items, qsort() may fall back to an in-place quicksort if it cannot allocate memory for a temporary array with malloc(). This algorithm is not a stable sort even if the comparison function is written in the described manner. Fixes #10672. Signed-off-by: Anders Kaseorg <andersk@mit.edu>
Diffstat (limited to 'ChangeLog')
-rw-r--r--ChangeLog6
1 files changed, 6 insertions, 0 deletions
diff --git a/ChangeLog b/ChangeLog
index c2d99a027b..bf140d33f4 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,9 @@
+2014-12-10 Anders Kaseorg <andersk@MIT.EDU>
+
+ [BZ #10672]
+ * manual/search.texi: (Array Sort Function): Remove claim how make
+ qsort stable.
+
2014-12-10 Andreas Schwab <schwab@suse.de>
[BZ #12847]