Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: OT: How to find anagrams?

by bl0rf (Pilgrim)
on Apr 28, 2004 at 02:20 UTC ( #348685=note: print w/ replies, xml ) Need Help??


in reply to OT: How to find anagrams?

isn't this one of those problems which turns into an n2, n3, n4 type problem, with n as a big number to start with?
:-D, most problems end up that way!

I think dragonchild has a good algorithm, I would only add that, before looping you should make a pass over your dictionary and copy to a new file/memory-location all words that are composed only of the letters ACELNS. This way you will be able to conduct consequent searches on this small subset of the whole dictionary as opposed to the whole thing. This will optimize your O() a lot ( btw O means the speed at which each operation is made, don't think about it a lot if you're not familiar with it... )

My site
Too cheap to make a signature


Comment on Re: OT: How to find anagrams?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://348685]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (7)
As of 2014-08-23 00:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (168 votes), past polls