Permutation Generation: Two New Permutation Algorithms
classification
💻 cs.DS
cs.CC
keywords
algorithmpermutationalgorithmsgenerationimplementationlevelpermutationscompletely
read the original abstract
Two completely new algorithms for generating permutations, shift-cursor algorithm and level algorithm, and their efficient implementations are presented in this paper. One implementation of the shift cursor algorithm gives an optimal solution of the permutation generation problem, and one implementation of the level algorithm can be used to generate random permutations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.