From 671764beb0278e2a74681020e6f23880075f6839 Mon Sep 17 00:00:00 2001
From: Tim Peters <tim.peters@gmail.com>
Date: Fri, 9 Aug 2002 05:06:44 +0000
Subject: Repaired a braino in the description of bad minrun values.

---
 Objects/listsort.txt | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Objects/listsort.txt b/Objects/listsort.txt
index d80f221..906b803 100644
--- 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,
-- 
cgit v0.12