summaryrefslogtreecommitdiffstats
path: root/Lib
diff options
context:
space:
mode:
authorTim Peters <tim.peters@gmail.com>2001-02-20 11:24:35 (GMT)
committerTim Peters <tim.peters@gmail.com>2001-02-20 11:24:35 (GMT)
commit754ba589b7c94a178636c10fe9812350bbbdb445 (patch)
tree3c2e12c34fbed1cd0ed34d30bc03f2b64f7c5a63 /Lib
parentf0768c822bf9f14dedf726aad97653cd515c7054 (diff)
downloadcpython-754ba589b7c94a178636c10fe9812350bbbdb445.zip
cpython-754ba589b7c94a178636c10fe9812350bbbdb445.tar.gz
cpython-754ba589b7c94a178636c10fe9812350bbbdb445.tar.bz2
Improve accuracy. In the .tex file, note the new "% BUG:" comments: an
extra backslash is getting displayed in the generated HTML.
Diffstat (limited to 'Lib')
-rw-r--r--Lib/difflib.py6
1 files changed, 3 insertions, 3 deletions
diff --git a/Lib/difflib.py b/Lib/difflib.py
index 759d33f..deb7361 100644
--- a/Lib/difflib.py
+++ b/Lib/difflib.py
@@ -92,9 +92,9 @@ See also function get_close_matches() in this module, which shows how
simple code building on SequenceMatcher can be used to do useful work.
Timing: Basic R-O is cubic time worst case and quadratic time expected
-case. SequenceMatcher is quadratic time worst case and has expected-case
-behavior dependent on how many elements the sequences have in common; best
-case time (no elements in common) is linear.
+case. SequenceMatcher is quadratic time for the worst case and has
+expected-case behavior dependent in a complicated way on how many
+elements the sequences have in common; best case time is linear.
SequenceMatcher methods: