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}
}
  • S. Zaks
  • Published 1984
  • Mathematics, Computer Science
  • BIT Numerical Mathematics
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. 
41 Citations
Parallel permutation generation on linear array
  • Chau-Jy Lin
  • Mathematics, Computer Science
  • Int. J. Comput. Math.
  • 1991
  • 6
Parallel generation of permutations and combinations
  • 39
On generation of permutations through decomposition of symmetric groups into cosets
  • Z. Kokosinski
  • Mathematics, Computer Science
  • BIT Comput. Sci. Sect.
  • 1990
  • 22
  • PDF
Efficient enumeration of cyclic permutations in situ
  • 1
On Generation of Permutations through Suffix/Prefix Reversing in a Cellular Network
  • 1
  • Highly Influenced
  • PDF
Parallel generation of permutations on systolic arrays
  • 11
New Permutation Generation Under Exchange Strategy (PGuES)
  • 1
  • PDF
On generation of permutations through su x / pre x reversing in a cellular network
  • Zbigniew Kokosi
  • 2003
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-8 OF 8 REFERENCES
Bounds for sorting by prefix reversal
  • 283
  • PDF
Permutation Generation Methods
  • 248
  • PDF
Generation of permutations by adjacent transposition
  • 205
  • PDF
Algorithm 115: Perm
  • 107
Combinatorial algorithms
  • 752
Algorithm 466: four combinatorial algorithm [G6]
  • 21