Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
Author:
Open Access
- 1 July 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 20 (3) , 500-513
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Algorithm 382: combinations of M out of N objects [G6]Communications of the ACM, 1970
- Generation of permutations by adjacent transpositionMathematics of Computation, 1963
- Algorithm 115: PermCommunications of the ACM, 1962
- Gray Codes and Paths on the n-CubeBell System Technical Journal, 1958