A new algorithm for generation of permutations

  title={A new algorithm for generation of permutations},
  author={Shmuel Zaks},
  journal={BIT Numerical Mathematics},
  • S. Zaks
  • Published 1 June 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. 
A Unified Framework to Discover Permutation Generation Algorithms
Two simple, intuitive, and general algorithmic frameworks can be used to design a wide variety of permutation generation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins, and Lipski.
Efficient enumeration of cyclic permutations in situ
  • M. Er
  • Computer Science, Mathematics
  • 1989
An efficient algorithm for generating all cyclic permutations of length n is derived, and its correctness is proven.
New recursive circular algorithm for listing all permutations
A new recursive strategy is proposed to generate starter sets that will not incur equivalence by circular operation and the result indicates that the new algorithm is faster than the other two in time execution.
On Generation of Permutations through Suffix/Prefix Reversing in a Cellular Network
In this paper a new permutation generator is proposed. Each subsequent permutation is generated in a cellular permutation network by reversing a suffix/prefix of the preceding permutation. The
New Permutation Generation Under Exchange Strategy (PGuES)
An exchange based technique for generating permutation that involved exchanging two consecutive elements, to generate the starter sets and the numerical result shows that new method is better than other existing methods.
Application of half butterfly method in listing permutation
This paper presented a permutation generation using Half Butterfly Method, a new method introduced to construct the distinct circuits in complete graphs where used the concept of isomorphism.
Star transposition Gray codes for multiset permutations
The proofs establish Hamilton-connectedness or Hamilton-laceability of the underlying flip graphs, and they answer several cases of a recent conjecture of Shen and Williams.
The Greedy Gray Code Algorithm
We reinterpret classic Gray codes for binary strings, permutations, combinations, binary trees, and set partitions using a simple greedy algorithm. The algorithm begins with an initial object and an
On The Diameter of Pancake Graphs
The Pancake graph( P n ) represents the group of all permutations on n elements, namely S n , with respect to the generating set containing all prefix reversals. The diameter of a graph is the maximum


A simplified loop-free algorithm for generating permutations
A simplification of Ehrlich's loop-free version of Johnson and Trotter's algorithm for generation of all permutations of a set of elements and its validity is proved.
Bounds for sorting by prefix reversal
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
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
Permutation Generation Methods
The paper is intended not only as a survey of permuta t ion generation methods, but also as a tutomal on how to compare a number of different algori thms for the same task.
Algorithm 115: Perm
this cyclic o r d e r-t h e vertices of a simple closed p o l y g o n a n d (x0, y0) is a p o i n t n o t on a n y side of t h e polygon, t h e n t h e procedure d e t e r m i n e s , b y s e t t i n
Generation of permutations by adjacent transposition
1. RICHARD S. VARGA, Matrix Iterative Analysis, Prentice-Hall, Inc., 1962. 2. E. G. D'YAKONOV, "On a Method of Solving the Poisson Equation," Dokl. Akad. Nauk SSSR 143 (1962), 21-24, the same paper