Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
Gideon Ehrlich · Journal of the ACM · 1973
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.
Cited by 184 works. doi:10.1145/321765.321781 Open-access PDF