Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^5: Better algorithm than brute-force stack for combinatorial problems? (using A::L)

by tye (Sage)
on May 22, 2004 at 21:38 UTC ( [id://355629]=note: print w/replies, xml ) Need Help??


in reply to Re: Re^3: Better algorithm than brute-force stack for combinatorial problems? (explain)
in thread Better algorithm than brute-force stack for combinatorial problems?

The main problem I was commenting upon though is subtly different from understanding how to use NestedLoops.

Yes. I'd hoped my explanation might still help with the other problem (and help others understand the code)...

It's more a case of wrapping my brain around how to apply it to any given problem. I guess it is really no more complicated that coding a recursive routine and remembering [...]

Yeah, that certainly sounds like a difficult way to go about it. Instead, think of writing foreach loops. Does that help much? I could elaborate but I'd rather do that based on your response. I could go into how to write foreach loops but maybe that isn't something you need elaboration on. (:

- tye        

  • Comment on Re^5: Better algorithm than brute-force stack for combinatorial problems? (using A::L)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (7)
As of 2024-05-28 07:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found