Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
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 (Sage)
on Sep 18, 2020 at 20:05 UTC ( #11121935=note: print w/replies, xml ) Need Help??


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]

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://11121935]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (5)
As of 2022-12-09 02:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?