Methods for obtaining all possible permutations of a number of objects, in which each permutation differs from its predecessor only by the interchange of two of the objects, are discussed. Details of two programs which produce these permutations are given, one allowing a specified position to be filled by each of the objects in a predetermined order, the other needing the minimum of storage space in a computer.
No takes yet. Share an insight, caveat, or question.
B. R. Heap (1963) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: