Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Finding all Combinations

by Masem (Monsignor)
on Nov 29, 2001 at 16:59 UTC ( #128337=note: print w/ replies, xml ) Need Help??

in reply to Finding all Combinations

Sounds familiar... though the code offered there might not be great for a school assignment, but there are other solutions listed as well.

Dr. Michael K. Neylon - || "You've left the lens cap of your mind on again, Pinky" - The Brain
"I can see my house from here!"
It's not what you know, but knowing how to find it if you don't know that's important

Comment on Re: Finding all Combinations
Replies are listed 'Best First'.
(tye)Re2: Finding all Combinations
by tye (Sage) on Nov 29, 2001 at 20:25 UTC

    You link to a discussion of permutations but the original poster requested combinations and it appears to me that the code here does find combinations (though I didn't fully digest the code so I could be wrong). Update: But actually running the code (modified so that I don't need the mentioned module) shows that it is finding permutations. *sigh* (:

    Confusion between these two is not uncommon. See (tye)Re: Permutations for another instance and a bit of explanation of how to tell the two apart.

            - tye (but my friends call me "Tye")
      Thanks for the input, and yes my misguidedness did mean to say permutations. I tried your permutations sub and that did speed up the program a small ammount. It turns out that Algorithm::Permute is much faster than them both so I'm using that now instead. Thanks.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (8)
As of 2016-05-03 16:40 GMT
Find Nodes?
    Voting Booth?