On 11/15/05, aurelianito <aurelianocalvo / yahoo.com.ar> wrote:
> Hi!
> This is my first post to the ruby quiz :).
>
> I've read it and remembered a structure that I've studied in college,
> the Trie. So I've implemented a very ineficient Trie and tried it.
>
> In a trie, there is a tree of letters. Each word is saved in the tree
> (so, words with the same root share a part of the trie, saving space).
> I've added to this structure the references for each word.
>

This sounds similar to how LZW compression works. Cool!


--
Into RFID? www.rfidnewsupdate.com Simple, fast, news.