1 files changed, 1 insertions, 1 deletions
diff --git a/doc/algorithm.txt b/doc/algorithm.txt
index b022dde..34960bd 100644
--- a/doc/algorithm.txt
+++ b/doc/algorithm.txt
@@ -121,7 +121,7 @@ At least for deflate's output that generates new trees every several 10's of
 kbytes.  You can imagine that filling in a 2^15 entry table for a 15-bit code
 would take too long if you're only decoding several thousand symbols.  At the
 other extreme, you could make a new table for every bit in the code.  In fact,
-that's essentially a Huffman tree.  But then you spend two much time
+that's essentially a Huffman tree.  But then you spend too much time
 traversing the tree while decoding, even for short symbols.
 So the number of bits for the first lookup table is a trade of the time to

diff --git a/doc/algorithm.txt b/doc/algorithm.txt index b022dde..34960bd 100644 --- a/doc/algorithm.txt +++ b/doc/algorithm.txt
@@ -121,7 +121,7 @@ At least for deflate's output that generates new trees every several 10's of
121	kbytes. You can imagine that filling in a 2^15 entry table for a 15-bit code	121	kbytes. You can imagine that filling in a 2^15 entry table for a 15-bit code
122	would take too long if you're only decoding several thousand symbols. At the	122	would take too long if you're only decoding several thousand symbols. At the
123	other extreme, you could make a new table for every bit in the code. In fact,	123	other extreme, you could make a new table for every bit in the code. In fact,
124	that's essentially a Huffman tree. But then you spend two much time	124	that's essentially a Huffman tree. But then you spend too much time
125	traversing the tree while decoding, even for short symbols.	125	traversing the tree while decoding, even for short symbols.
126		126
127	So the number of bits for the first lookup table is a trade of the time to	127	So the number of bits for the first lookup table is a trade of the time to