diff options
| author | Serhiy Storchaka <storchaka@gmail.com> | 2015-12-18 11:23:33 (GMT) |
|---|---|---|
| committer | Serhiy Storchaka <storchaka@gmail.com> | 2015-12-18 11:23:33 (GMT) |
| commit | 42bb126f0aa1de4817babb8c56b9ad6df8bab458 (patch) | |
| tree | 4f1c6880b00bd60cc4bdbc36636f87145131cfbb | |
| parent | dc7a91f787ec2bd516eaec73b67d908939b4a8a5 (diff) | |
| download | cpython-42bb126f0aa1de4817babb8c56b9ad6df8bab458.zip cpython-42bb126f0aa1de4817babb8c56b9ad6df8bab458.tar.gz cpython-42bb126f0aa1de4817babb8c56b9ad6df8bab458.tar.bz2 | |
Issue #25899: Converted Objects/listsort.txt to UTF-8.
Original patch by Chris Angelico.
| -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 832e4f2..fef982f 100644 --- a/Objects/listsort.txt +++ b/Objects/listsort.txt @@ -486,7 +486,7 @@ sub-run, yet finding such very efficiently when they exist. I first learned about the galloping strategy in a related context; see: "Adaptive Set Intersections, Unions, and Differences" (2000) - Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro + Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro and its followup(s). An earlier paper called the same strategy "exponential search": |