diff options
| author | Fred Drake <fdrake@acm.org> | 1999-02-19 17:54:10 (GMT) |
|---|---|---|
| committer | Fred Drake <fdrake@acm.org> | 1999-02-19 17:54:10 (GMT) |
| commit | d8a41e6391764770cfbe02f1bda7c97e761d1e6d (patch) | |
| tree | e0e9c911f74c859c86d66e86095135ea2b8fff01 /Doc/lib/libbisect.tex | |
| parent | f6346345b0fcad09d42fc15e2fa8d460fc03c4e8 (diff) | |
| download | cpython-d8a41e6391764770cfbe02f1bda7c97e761d1e6d.zip cpython-d8a41e6391764770cfbe02f1bda7c97e761d1e6d.tar.gz cpython-d8a41e6391764770cfbe02f1bda7c97e761d1e6d.tar.bz2 | |
Fix an amazing number of typos & malformed sentences reported by Detlef
Lannert <lannert@uni-duesseldorf.de>.
Diffstat (limited to 'Doc/lib/libbisect.tex')
| -rw-r--r-- | Doc/lib/libbisect.tex | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/Doc/lib/libbisect.tex b/Doc/lib/libbisect.tex index 246d6c7..e36cf0e 100644 --- a/Doc/lib/libbisect.tex +++ b/Doc/lib/libbisect.tex @@ -15,9 +15,8 @@ without having to sort the list after each insertion. For long lists of items with expensive comparison operations, this can be an improvement over the more common approach. The module is called \module{bisect} because it uses a basic bisection algorithm to do its -work. The source code may be used a useful reference for a working -example of the algorithm (i.e., the boundary conditions are already -right!). +work. The source code may be most useful as a working example of the +algorithm (i.e., the boundary conditions are already right!). The following functions are provided: |