(Array Sort Function): Say stabilizing can make qsort slower.

diff --git a/manual/search.texi b/manual/search.texi
index b328a39be0eb257ec9fe3bd0bdc9b37b05b66c43..d914135297651df7829012405fdec197e677a1de 100644 (file)
--- a/manual/search.texi
+++ b/manual/search.texi
@@ -118,6 +118,8 @@ respects.
 If you want the effect of a stable sort, you can get this result by
 writing the comparison function so that, lacking other reason
 distinguish between two elements, it compares them by their addresses.
+Note that doing this may make the sorting algorithm less efficient, so
+do it only if necessary.
 
 Here is a simple example of sorting an array of doubles in numerical
 order, using the comparison function defined above (@pxref{Comparison