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

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.

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

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 by tobyink (Canon) on Sep 18, 2020 at 11:56 UTC
Only takes a lot of memory if you cache the unsuccessful hits. toby döt ink	[reply]