diff options
| author | Steve Dower <steve.dower@microsoft.com> | 2017-02-04 15:39:38 -0800 |
|---|---|---|
| committer | Steve Dower <steve.dower@microsoft.com> | 2017-02-04 15:39:38 -0800 |
| commit | 1a5780aabb550cae175ad8711e2f33ba644d0ddb (patch) | |
| tree | 68e47eaafb4ccc17bbdb7668c6058984945b332d /Objects/listsort.txt | |
| parent | 956c7cfa7111ab5458e2f69868a05b7b84fc6843 (diff) | |
| parent | d1d8706cdb77e2adbbb4110338dcda0e1811f892 (diff) | |
| download | cpython-1a5780aabb550cae175ad8711e2f33ba644d0ddb.tar.gz | |
Issue #29319: Prevent RunMainFromImporter overwriting sys.path[0].
Diffstat (limited to 'Objects/listsort.txt')
| -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 152a2700ad..17d27973f8 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": |