Permutation Generation: Two New Permutation Algorithms
Data Structures and Algorithms
2007-05-23 v3 Computational Complexity
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.
Keywords
Cite
@article{arxiv.cs/0306025,
title = {Permutation Generation: Two New Permutation Algorithms},
author = {Jie Gao and Dianjun Wang},
journal= {arXiv preprint arXiv:cs/0306025},
year = {2007}
}
Comments
7 pages, 4 figures