Mercurial > hg > xemacs-beta

diff lib-src/qsort.c @ 444:576fb035e263 r21-2-37

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Import from CVS: tag r21-2-37
author cvs
date Mon, 13 Aug 2007 11:36:19 +0200
parents 376386a54a3c
children 061f4f90f874
line wrap: on
line diff
--- a/lib-src/qsort.c	Mon Aug 13 11:35:05 2007 +0200
+++ b/lib-src/qsort.c	Mon Aug 13 11:36:19 2007 +0200
@@ -64,7 +64,7 @@
       stack.  Assuming a 32-bit integer, this needs only 32 * 
       sizeof (stack_node) == 136 bits.  Pretty cheap, actually.
 
-   2. Chose the pivot element using a median-of-three decision tree.
+   2. Choose the pivot element using a median-of-three decision tree.
       This reduces the probability of selecting a bad pivot value and 
       eliminates certain extraneous comparisons.