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

Tim's quicksort on May 13.

This commit is contained in:
Guido van Rossum 1998-05-13 21:21:24 +00:00
parent b7057640d1
commit ed7adcff73
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Objects/listobject.c
View File

@ -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. */