论文信息 - Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

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.

Gideon Ehrlich | G. Ehrlich

[1] Gideon Ehrlich. Four Combinatorial Algorithms [G6] (Algorithm 466). , 1973 .

[2] Selmer M. Johnson. Generation of permutations by adjacent transposition , 1963 .

[3] Hale F. Trotter,et al. Algorithm 115: Perm , 1962, CACM.

[4] E. Gilbert. Gray codes and paths on the N-cube , 1958 .

[5] R. J. Ord-Smith. Generation of Permutation Sequences: Part 2 , 1971, Comput. J..

[6] Journal of the Association for Computing Machinery , 1961, Nature.