Tim's quicksort on May 13.

diff --git a/Objects/listobject.c b/Objects/listobject.c
index 12abb8fc675f54b20e50f7622629571497159399..60e1592348c0294899a1610dfa200323314c4339 100644 (file)
--- 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. */