Permutation Generation: Two New Permutation Algorithms
<|reference_start|>Permutation Generation: Two New Permutation Algorithms: 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.<|reference_end|>
@article{gao2003permutation,
    title={Permutation Generation: Two New Permutation Algorithms},
    author={Jie Gao, and Dianjun Wang},
    journal={arXiv preprint arXiv:cs/0306025},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0306025},
    primaryClass={cs.DS cs.CC}
}