Article View: net.database
Article #211Compressed Tries (Knuth 6.3p4)
From: hokey
Date: Sat, 08 Mar 1986 19:45
Date: Sat, 08 Mar 1986 19:45
11 lines
872 bytes
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
Technical Details
Message-ID:
<982@plus5.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!ltuxa!we53!wucs!wuphys!plus5!hokeyShow Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!ltuxa!we53!wucs!wuphys!plus5!hokey From: hokey@plus5.UUCP Newsgroups: net.database Subject: Compressed Tries (Knuth 6.3p4) Message-ID: <982@plus5.UUCP> Date: Sat, 8-Mar-86 14:45:11 EST Article-I.D.: plus5.982 Posted: Sat Mar 8 14:45:11 1986 Date-Received: Sun, 9-Mar-86 09:43:50 EST Organization: Plus Five Computer Services, St. Louis Lines: 11