Repaired a braino in the description of bad minrun values.

diff --git a/Objects/listsort.txt b/Objects/listsort.txt
index d80f22117a72e5bc6731e09a3387d5e0a0c091c2..906b803746a449debd5263bf2ff74320194a0771 100644 (file)
--- 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,