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


Syntactic Confectionery Delight
	PerlMonks

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

by Eily (Monsignor)

on Sep 18, 2020 at 19:45 UTC ( [id://11121934]=note: print w/replies, xml )

Need Help??

in reply to Re^2: 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

I mentioned your post because reading your it made me think "oh right, using substr is probably more efficient than changing then joining an array". Although it's not really the generalisation of your code. Also it let me make the Perlmonks::Combinatorics joke 😁

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

Replies are listed 'Best First'.

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

> 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}

[reply]

In Section Seekers of Perl Wisdom