Re: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

For computational efficiency, you'll want to use an "iterator" pattern. Search here, there are quite a few interesting posts about this. You can also read about them in section 4.3.1 of Dominus' Higher Order Perl. There are also quite a few CPAN modules that might help.

Comment on Re: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

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 by Anonymous Monk on Sep 18, 2020 at 16:46 UTC
MJD's iterators are awesome, but not fast.	[reply]