| [reply] |
a couple of things,
The major problem with the code you have there is that it doesn't give combinations of separated list items, it only gives items from one point forward. As an example:
for n=3, with items 1,2, and 3, i get the following from your code:
1
1 2
1 2 3
2
2 3
3
Note the missing '1 3' case. For the items 1,2,3, and 4, '134', '124', '13', '14', etc would be missing.
Merlyn's snippets are a nice and easy way to go; a simple transformation and they will return an array of strings instead of an AoA. As an exercise, i chalked up a non-recursive solution as well; it returns an array of arrays as merlyn's does.
sub combinations {
my (@comb, $pos);
my $limit = 2**@_;
while (my $item = shift) {
my $step = 2**@_;
for ($pos = 0; $pos < $limit; $pos += $step) {
push @{$comb[$pos++]}, $item for 1..$step;
}
}
return @comb, [];
}
jynx | [reply]
[d/l] |
There was nothing particularly wrong with this question.
Why was it reaped? Even if it was homework, asking for help
on homework isn't wrong. THAT'S HOW PEOPLE LEARN! | [reply] |
| [reply] |
oops, spoke too soon.
the cpan module and sample code generate permutations, I need combinations. I don't care about the order of the array elements.
@array=qw(big bad prog) --->
big
bad
prog
big bad
big prog
big bad prog
| [reply] |
#Yet another way to do it
sub combinations{
return map{my $i=$_<<1;[grep{($i>>=1)&1}@_]}0..(1<<@_)-1
}
| [reply]
[d/l] |
