Combinatorial algorithms: generation, enumeration, and search

The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loop-less algorithms can be fused to produce a new loop-less algorithm that solves the original problem. We ...