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

(tye)Re3: Finding all Combinations

by tye (Sage)
on Sep 12, 2002 at 05:43 UTC ( #197151=note: print w/replies, xml ) Need Help??


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

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?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://197151]
help
Chatterbox?
[karlgoethebier]: choroba: another chapter of "Learning English At The Monastry"?
[shmem]: Corion, well then... next issue, sequence number not a shared resource :P
[Discipulus]: shmem i'm searching it.. but failing i was sure was in Re: Let's Make PerlMonks Great Again! -- suggestions and dreams
erix recommends Vanished Kingdoms
[Corion]: shmem: Yeah, something like that. Not that that would be a solved issue. Simply process all events that come in from a single interface sequentially. Ah well.
[Discipulus]: their

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (11)
As of 2017-05-23 08:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?