in reply to Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's
One solution which I find pretty intuitive is to start with all zeros, and change N of thems into ones. Then the problems becomes "get all the combinations of three distinct positions", which can be achieved by using combination() function from Algorithm::Combinatorics.
Now for the matter of speed, if it's really that important you'll have to benchmark, but if you're going to print each string then print is probably going to make the execution time of generating the string insignificant.use strict; use warnings; use feature 'say'; use Algorithm::Combinatorics qw(combinations); my $length = 10; my $ones = 2; my $iter = combinations([0..$length-1], $ones); while (my $positions = $iter->next) { my @data = (0,) x $length; $data[$_] = 1 for @$positions; say join "", @data; }
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's -- permutations
by Discipulus (Canon) on Sep 18, 2020 at 08:35 UTC | |
by choroba (Cardinal) on Sep 18, 2020 at 09:12 UTC | |
by hippo (Bishop) on Sep 18, 2020 at 09:21 UTC | |
by Discipulus (Canon) on Sep 18, 2020 at 10:05 UTC | |
by Eily (Monsignor) on Sep 18, 2020 at 08:39 UTC |
In Section
Seekers of Perl Wisdom