Permutation Generation: Two New Permutation Algorithms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
7 pages, 4 figures

Keywords

Data Structures and Algorithms, Computational Complexity, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31598

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0306025
 http://arxiv.org/abs/cs/0306025

Collections

arXiv