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

Re: (tye)Re2: Finding all Combinations

by redbeard (Beadle)
on Sep 11, 2002 at 22:36 UTC ( #197105=note: print w/replies, xml ) Need Help??

in reply to (tye)Re2: Finding all Combinations
in thread Finding all Combinations

Indeed - I'm not as familiar with binary, so I'll have to ponder a bit, but thanks! I was working on this problem and was working on an algorithm that would iterate through all combos, but the checking back to see if you were REALLY done once you had reached the end of a set was killer for large sets (e.g. 30)...

Replies are listed 'Best First'.
(tye)Re3: Finding all Combinations
by tye (Sage) on Sep 12, 2002 at 05:43 UTC

    Change the while condition to:     while( 9 < ++$pick[$i]  ) {
    and the return statment to     return reverse @pick;
    and it will count in base 10. Perhaps that will make it easier to understand what it was doing.

            - tye (but my friends call me "Tye")

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://197105]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (5)
As of 2018-06-24 21:32 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (126 votes). Check out past polls.