Damn Cool Algorithms, Part 3: Anagram Trees - Nick's blog - The Diigo Meta page

• 23 Dec 07
  

  takayuki kawamoto

  algorithm algorithms

• 

  Yuri Baranov

  Computer science Algorithms

• 

  Joel Liu

  I hesitate to call this algorithm "damn cool", since it's something I invented*
  it myself, but I think it is rather cool, and it fits the theme of my
  algorithms posts, so here it is anyway.

  algorithms

  • 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:

Would you like to comment?

Join Diigo for a free account, or sign in if you are already a member.