A new algorithm for generation of permutations
@article{Zaks1984ANA,
title={A new algorithm for generation of permutations},
author={S. Zaks},
journal={BIT Numerical Mathematics},
year={1984},
volume={24},
pages={196-204}
}A new algorithm for generating permutations is presented, that generates the next permutation by reversing a certain suffix of its predecessor. The average size of this suffix is less thane ≅ 2.8. It is shown how to find the position of a given permutation and how to construct the permutation of a given position, where the position refers to the order in which the permutations are generated, and is also new.
Topics from this paper
40 Citations
Parallel permutation generation on linear array
- Mathematics, Computer Science
- Int. J. Comput. Math.
- 1991
- 6
Parallel generation of permutations and combinations
- Mathematics, Computer Science
- BIT Comput. Sci. Sect.
- 1986
- 39
On generation of permutations through decomposition of symmetric groups into cosets
- Mathematics, Computer Science
- BIT Comput. Sci. Sect.
- 1990
- 22
- PDF
On Generation of Permutations through Suffix/Prefix Reversing in a Cellular Network
- Computer Science
- PPAM
- 2003
- 1
- Highly Influenced
- PDF
On generation of permutations through su x / pre x reversing in a cellular network
- 2003
- Highly Influenced
- PDF
References
SHOWING 1-8 OF 8 REFERENCES
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Mathematics, Computer Science
- JACM
- 1973
- 186