summaryrefslogtreecommitdiff
path: root/Objects/listsort.txt
diff options
context:
space:
mode:
Diffstat (limited to 'Objects/listsort.txt')
-rw-r--r--Objects/listsort.txt2
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":