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

> sub Eily_LanX

I'm not sure how I should take merits for Eily's work °... But thanks. :)

My goal was simplicity, if it was about speed I might provide an other approach plus case optimization. (Like inverting to the dual case if more than half of the bits are ones)

The output format should be clarified though. String, bit vector, array...?

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery}

°) oh I see Re^2: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

Comment on Re^2: 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^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
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 😁	[reply]
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]