http://qs1969.pair.com?node_id=11121935


in reply to Re^3: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's [Updated]
in thread Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

> 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
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery

  • Comment on Re^4: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's [Updated]

In Section Seekers of Perl Wisdom