|
|
|
| There's more than one way to do things | |
| PerlMonks |
Re^3: How can one generate all possible combinations with reference to string positions?by kennethk (Abbot) |
| on Feb 25, 2013 at 15:37 UTC ( [id://1020535]=note: print w/replies, xml ) | Need Help?? |
|
The transform 3-$l only works if you are working with 1 and 2 as your permuted set; it happens that for that set 3-$l is equivalent to "the member of the set that is not $l". If you need any degree of flexibility, you should follow the code in Re: How can one generate all possible combinations with reference to string positions?, subject to BrowserUK's comments. #11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||