Compressed Tries (Knuth 6.3p4)

Thread View: net.database

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by hokey Sat, 08 Mar 1986 19:45

#211

Author: hokey
Date: Sat, 08 Mar 1986 19:45

11 lines
872 bytes

In V3 Knuth, chapter 6.3, problem 4, there is a compressed version of a
trie.  Basically, a trie table of 360 elements was compressed into a table
of 55 entries.

However, I have found no explanation of how the compression was performed.

Any help on unlocking the mystery of the compression algorithm would be
greatly appreciated.
-- 
Hokey           ..ihnp4!plus5!hokey
		  314-725-9492

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads