From 01155ccc3f822a31291a64e4ecd5f1dbb8a8ee63 Mon Sep 17 00:00:00 2001 From: THE-Spellchecker Date: Sat, 2 Dec 2023 16:56:47 -0600 Subject: Fix random typos over several source and text files. --- doc/algorithm.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'doc') diff --git a/doc/algorithm.txt b/doc/algorithm.txt index c97f495..029e5a3 100644 --- a/doc/algorithm.txt +++ b/doc/algorithm.txt @@ -77,7 +77,7 @@ table took no time (and if you had infinite memory), then there would only be a first level table to cover all the way to the longest code. However, building the table ends up taking a lot longer for more bits since short codes are replicated many times in such a table. What inflate() does is -simply to make the number of bits in the first table a variable, and then +simply to make the number of bits in the first table a variable, and then to set that variable for the maximum speed. For inflate, which has 286 possible codes for the literal/length tree, the size -- cgit v1.2.3-55-g6feb