summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorGuido van Rossum <guido@python.org>1998-05-13 21:21:24 (GMT)
committerGuido van Rossum <guido@python.org>1998-05-13 21:21:24 (GMT)
commited7adcff731695446e2d2add4ff03f67989e6ac3 (patch)
treec6b85b9da14745ea02e10a4890f6130a9a83d62d
parentb7057640d18ec9713aa1312b9d3270136144e53e (diff)
downloadcpython-ed7adcff731695446e2d2add4ff03f67989e6ac3.zip
cpython-ed7adcff731695446e2d2add4ff03f67989e6ac3.tar.gz
cpython-ed7adcff731695446e2d2add4ff03f67989e6ac3.tar.bz2
Tim's quicksort on May 13.
-rw-r--r--Objects/listobject.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/listobject.c b/Objects/listobject.c
index 12abb8f..60e1592 100644
--- a/Objects/listobject.c
+++ b/Objects/listobject.c
@@ -631,7 +631,7 @@ docompare(x, y, compare)
good assumption for Python), it should be 10, which is the cutoff
point: quicksort requires more comparisons than insertion sort for
smaller arrays. */
-#define MINSIZE 12
+#define MINSIZE 10
/* Straight insertion sort. More efficient for sorting small arrays. */