Thanks Corion. The exact problem is about finding all the combinations. I find Math:Combinatorics useful as well.
Here is what i did to gather all 2-item combinations from N item array. I wasn't sure how i would do it for any M items.
@a=(1..5);
my @comb="";
for(my $i=0;$i<=$#a;$i++) {
for(my $j=0;$j<=$#a;$j++) {
next if $i==$j;
if ($a[$i] < $a[$j]) { push @comb, "$a[$i] , $a[$j]" ; }
else { push @comb, "$a[$j] , $a[$i]" ; }
}
}
shift @comb;
use List::MoreUtils qw(uniq);
@comb = uniq(@comb);
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|