generating all subsets of an array

dazai has asked for the wisdom of the Perl Monks concerning the following question:

Replies are listed 'Best First'.
Re: generating all subsets of an array by Roy Johnson (Monsignor) on May 27, 2005 at 16:41 UTC
Yes. Search for powerset. Caution: Contents may have been coded under pressure.	[reply]
Re: generating all subsets of an array by Limbic~Region (Chancellor) on May 27, 2005 at 16:56 UTC
dazai, Here are some solutions if you don't have much luck Super Searching. Re^2: Generating powerset with progressive ordering (p5, iterative, progressive) Pugs Powerset With Progressive Ordering (p6, iterative, progressive) Re^2: Finding all Combinations (p5, iterative, smallest -> largest) Re^4: Perl6 Contest: Test your Skills (p6, iterative, smallest -> largest) Re^3: Perl6 Contest: Test your Skills (p6, recursive, smallest -> largest) Cheers - L~R	[reply]
Re: generating all subsets of an array by Cristoforo (Curate) on May 28, 2005 at 01:06 UTC
Algorithm::ChooseSubsets does this. The output follows __END__. `use strict; use warnings; use Algorithm::ChooseSubsets; my @items = qw/red white blue/; my $iter = Algorithm::ChooseSubsets->new(\@items); while (my $x = $iter->next) { print "@$x\n" } __END__ C:\perlp>perl t2.pl red white blue red white red blue white blue red white blue C:\perlp>` [download] Chris	[reply] [d/l]