diff options
| author | Andrew M. Kuchling <amk@amk.ca> | 2006-08-01 16:24:30 (GMT) |
|---|---|---|
| committer | Andrew M. Kuchling <amk@amk.ca> | 2006-08-01 16:24:30 (GMT) |
| commit | 5a51bf50b8405c24c2700db725855fa4b3a7cbcc (patch) | |
| tree | f7257a5ab05ad1732769636474fc19e41e8e4963 /Objects | |
| parent | fe5004fc860c0e40772c8991ed40cc090a706cf9 (diff) | |
| download | cpython-5a51bf50b8405c24c2700db725855fa4b3a7cbcc.zip cpython-5a51bf50b8405c24c2700db725855fa4b3a7cbcc.tar.gz cpython-5a51bf50b8405c24c2700db725855fa4b3a7cbcc.tar.bz2 | |
typo fix
Diffstat (limited to 'Objects')
| -rw-r--r-- | Objects/listsort.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/listsort.txt b/Objects/listsort.txt index 68e918d..9226984 100644 --- a/Objects/listsort.txt +++ b/Objects/listsort.txt @@ -494,7 +494,7 @@ and its followup(s). An earlier paper called the same strategy 467-474, Austin, Texas, 25-27 January 1993. and it probably dates back to an earlier paper by Bentley and Yao. The -McIlory paper in particular has good analysis of a mergesort that's +McIlroy paper in particular has good analysis of a mergesort that's probably strongly related to this one in its galloping strategy. |