Martin DeMello
2/24/2005 4:16:00 AM
linus sellberg <sellberg@google.com> wrote:
> Martin DeMello wrote:
> > at it and see what I can do without dropping into C? (It could be that
> > my anagram algorithm is naive too - suggestions welcomed)
>
> One of the most efficient algorithms for finding anagrams sorts both the
> grammar and the word you want to find anagrams for before it starts to
> compare anything.
>
> (that is, bar => abr)
That doesn't extend itself well to anagrams with wildcards, though.
DAWGs are nice for those.
martin