Abstract
When the permutations are ordered lexicographically there is an ordering number corresponding to each permutation. A relation between the ordering numbers of complementary permutations is shown which can be useful in a computer generation of permutations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. F. Beckenbach,Applied combinatorial mathematics, New York 1964.
E. Netto,Lehrbuch der Combinatorik, 2. Aufl. 1927 (Chelsea reprint).
J. R. Howell,Algorithm 87, Permutation generator, CACM, 4–62 (209).
G. F. Schrack and M. Shimrat,Algorithm 102, Permutation in lexicographical order, CACM, 6–62 (346).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mossige, S. Generation of permutations in lexicographical order. BIT 10, 74–75 (1970). https://doi.org/10.1007/BF01940891
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01940891