Damn Cool Algorithms, Part 3: Anagram Trees - Nick's blog
Popularity Report
 |
|||
|
|||
|
|||
|
|||
|
|||
|
Rank
URL Tag Cloud
Bookmark History
Saved by 3 people (-1 private), first by anonymouse user on 2007-12-23
- Philsci on 2007-12-23 - Tags algorithm , algorithms
- Baranoff on 2007-12-23 - Tags Computer , science , Algorithms
- Joel on 2007-12-23 - Tags algorithms
Public Sticky notes
However, with a little more effort, and the above observation that we can
generate a histogram that uniquely represents a given set of letters, we can
generate a tree structure that makes looking up subset anagrams much more
efficient. To build the tree, we follow this simple procedure:
Highlighted by joel
Public Comment