X-Git-Url: http://git.chise.org/gitweb/?p=chise%2Fxemacs-chise.git.1;a=blobdiff_plain;f=lib-src%2Fqsort.c;h=404469acd20a191e9583378f7611682e17a12ecd;hp=ff8ef60c71bf41e9edb5ac50c7d7c926e68e42c2;hb=1b70edcd9999965aafe4533453eb6b353b349898;hpb=6883ee56ec887c2c48abe5b06b5e66aa74031910

diff --git a/lib-src/qsort.c b/lib-src/qsort.c
index ff8ef60..404469a 100644
--- a/lib-src/qsort.c
+++ b/lib-src/qsort.c
@@ -64,7 +64,7 @@ typedef struct
       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.