Permutation enumeration: four new permutation algorithms

Authors:
F. M. Ives
Affiliations:
Western Washington State College, Bellingham
Venue:
Communications of the ACM
Year:
1976

Citing 2
Cited 5

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

Journal of the ACM (JACM)
Algorithm 466: four combinatorial algorithm [G6]

Communications of the ACM

Normal Random Numbers: Using Machine Analysis to Choose the Best Algorithm

ACM Transactions on Mathematical Software (TOMS)
Permutation Generation Methods

ACM Computing Surveys (CSUR)
Three new combination algorithms with the minimal change property

Communications of the ACM
Orderly enumeration of nonsingular binary matrices applied to text encryption

Communications of the ACM
A note on reflection-free permutation enumeration

Communications of the ACM

Quantified Score

Hi-index	48.26

Visualization

Abstract

Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The other two algorithms infrequently exchange more than two marks, but the rules for generating the next permutation are very simple. Performance tests which have counted execution of assignment statements, comparisons, arithmetic operations, and subscripted array references have shown superiority of the new algorithms compared to Boothroyd's implementation of M.B. Well's algorithm and Ehrlich's implementation of the Johnson-Trotter algorithm.