| commit | ed7adcff731695446e2d2add4ff03f67989e6ac3 | [log] [tgz] |
|---|---|---|
| author | Guido van Rossum <guido@python.org> | Wed May 13 21:21:24 1998 +0000 |
| committer | Guido van Rossum <guido@python.org> | Wed May 13 21:21:24 1998 +0000 |
| tree | c6b85b9da14745ea02e10a4890f6130a9a83d62d | |
| parent | b7057640d18ec9713aa1312b9d3270136144e53e [diff] [blame] |
Tim's quicksort on May 13.
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 @@ 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. */