traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Change comment about MINSIZE -- 10 is optimal for Python.

This commit is contained in:
Guido van Rossum 1996-12-16 03:32:39 +00:00
parent 81a6fe9b98
commit cc15b42e59
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
Objects/listobject.c
View File

@ -630,9 +630,12 @@ insertionsort(array, size, compare)
}
/* MINSIZE is the smallest array we care to partition; smaller arrays
are sorted using a straight insertion sort (above). You may want
to play with this to tune it for your system. It must be at least
2; more than 20 probably doesn't make sense. */
are sorted using a straight insertion sort (above). It must be at
least 2 for the quicksort implementation to work. Assuming that
comparisons are more expensive than everything else (and this is a
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 10
/* STACKSIZE is the size of our work stack. A rough estimate is that