Tim's quicksort on May 13.

gvanrossum · gvanrossum · commit ed7adcff7316 · 1998-05-13T21:21:24.000Z
diff --git 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. */
 
