Permutation Generation: Two New Permutation Algorithms

Simple item page
dc.creatorGao, Jie
dc.creatorWang, Dianjun
dc.date2003-06-05
dc.date2003-07-09
dc.date.accessioned2026-07-07T03:19:46Z
dc.date.available2026-07-07T03:19:46Z
dc.descriptionTwo 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.
dc.description7 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0306025
dc.identifierhttp://arxiv.org/abs/cs/0306025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31598
dc.subjectData Structures and Algorithms
dc.subjectComputational Complexity
dc.subjectF.2.2
dc.titlePermutation Generation: Two New Permutation Algorithms
dc.typetext

Files

Collections

arXiv