From: Guido van Rossum <guido@python.org>
Date: Wed, 13 May 1998 21:21:24 +0000 (+0000)
Subject: Tim's quicksort on May 13.
X-Git-Tag: v1.5.2a1~650
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=ed7adcff731695446e2d2add4ff03f67989e6ac3;p=python

Tim's quicksort on May 13.
---

diff --git a/Objects/listobject.c b/Objects/listobject.c
index 12abb8fc67..60e1592348 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. */