Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
A new permutation generation algorithm is presented in this study. The algorithm has the fastest software implementation because it uses exchanges of two elements, but certain software overhead is present due to analysis of generating numbers and m-module forward-backward counters.
How to cite this article:
O.V. Viktorov . Permutation Generation Algorithm.
DOI: https://doi.org/10.36478/ajit.2007.956.957
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2007.956.957