projects
/
chise
/
xemacs-chise.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
(U+8DC3): Unify C6-4538.
[chise/xemacs-chise.git]
/
lib-src
/
qsort.c
diff --git
a/lib-src/qsort.c
b/lib-src/qsort.c
index
ff8ef60
..
404469a
100644
(file)
--- 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.
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.
This reduces the probability of selecting a bad pivot value and
eliminates certain extraneous comparisons.