|
|
|
| Perl: the Markov chain saw | |
| PerlMonks |
Re^4: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's [Updated]by LanX (Saint) |
| on Sep 18, 2020 at 20:05 UTC ( [id://11121935]=note: print w/replies, xml ) | Need Help?? |
|
> using substr is probably more efficient Actually I "combined" this part from choroba's code in Re: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's Seems fitting, since I just finished an excellent TV show about the computer business in the 80/90s where people are constantly taking credit for "borrowed" ideas. ;)
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||