summaryrefslogtreecommitdiff
path: root/manual/search.texi
diff options
context:
space:
mode:
authorRoland McGrath <roland@gnu.org>1992-10-20 02:02:42 +0000
committerRoland McGrath <roland@gnu.org>1992-10-20 02:02:42 +0000
commit10eed5df74e056c664455081d1945b23be5adb23 (patch)
tree4e6d10ab1a9adaf258edfc8dbb0cc4c2d553178c /manual/search.texi
parent46b3719064a5f5b633b3ae2e41803a90e6b155e8 (diff)
Miscellaneous corrections after 1st proofreading.
Also added many comments with !!! marking problem spots.
Diffstat (limited to 'manual/search.texi')
-rw-r--r--manual/search.texi8
1 files changed, 4 insertions, 4 deletions
diff --git a/manual/search.texi b/manual/search.texi
index a58106474d..9dfed66bad 100644
--- a/manual/search.texi
+++ b/manual/search.texi
@@ -107,14 +107,14 @@ To sort an array using an arbitrary comparison function, use the
The @var{qsort} function sorts the array @var{array}. The array contains
@var{count} elements, each of which is of size @var{size}.
-The @var{compare} function is used to compare perform the comparison on
-the array elements. This function is called with two pointer arguments
-and should return an integer less than, equal to, or greater than zero
+The @var{compare} function is used to perform the comparison on the
+array elements. This function is called with two pointer arguments and
+should return an integer less than, equal to, or greater than zero
corresponding to whether its first argument is considered less than,
equal to, or greater than its second argument.
@cindex stable sorting
-@strong{Warning:} if two objects compare as equal, their order after
+@strong{Warning:} If two objects compare as equal, their order after
sorting is unpredictable. That is to say, the sorting is not stable.
This can make a difference when the comparison considers only part of
the elements. Two elements with the same sort key may differ in other