Because of the "unique" requirement, you can add a cache as well, so that it can take a lot of memory as well as time.
In reply to Re^2: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's
by Eily
in thread Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's
by Lana
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |