diff options
| author | Tim Peters <tim.peters@gmail.com> | 2002-08-09 05:06:44 +0000 |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2002-08-09 05:06:44 +0000 |
| commit | 671764beb0278e2a74681020e6f23880075f6839 (patch) | |
| tree | f0da655dc78c15933894920c645cd8ed406c927e /Objects/listsort.txt | |
| parent | 90128ba22c9dc3b4335053d6251afee78f0f93e2 (diff) | |
| download | cpython-git-671764beb0278e2a74681020e6f23880075f6839.tar.gz | |
Repaired a braino in the description of bad minrun values.
Diffstat (limited to 'Objects/listsort.txt')
| -rw-r--r-- | Objects/listsort.txt | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Objects/listsort.txt b/Objects/listsort.txt index d80f22117a..906b803746 100644 --- a/Objects/listsort.txt +++ b/Objects/listsort.txt @@ -275,9 +275,9 @@ What we want to avoid is picking minrun such that in q, r = divmod(N, minrun) q is a power of 2 and r>0 (then the last merge only gets r elements into -place, and r<minrun is small compared to N), or r=0 and q a little larger -than a power of 2 (then we've got a case similar to "2112", again leaving -too little work for the last merge to do). +place, and r < minrun is small compared to N), or q a little larger than a +power of 2 regardless of r (then we've got a case similar to "2112", again +leaving too little work for the last merge to do). Instead we pick a minrun in range(32, 65) such that N/minrun is exactly a power of 2, or if that isn't possible, is close to, but strictly less than, |