24 Aug
2009
24 Aug
'09
3:24 p.m.
On Mon, Aug 24, 2009 at 09:51:09AM -0500, Stephen Nuchia wrote:
I'd like a set of tools that will provide both exhaustive and random combinations and permutations of N items from M item sets or multisets (represented in a variety of concrete ways and with M >= N). Admitting multisets moves the problem from first-year to second- or third-year level. I like to keep things interesting ;-)
These, and many other algorithms, are described in the "fxt book": http://www.jjj.de/fxt/