Generation of permutations following Lehmer and Howell
HTML articles powered by AMS MathViewer
- by Enrico Spoletini PDF
- Math. Comp. 43 (1984), 565-572 Request permission
Abstract:
This paper proves two formulas used to obtain, by an arithmetic method, both the next permutation with respect to a given one and the mth permutation, in lexicographic direct ordering.References
- John R. Howell, Generation of permutations by addition, Math. Comp. 16 (1962), 243–244. MR 144828, DOI 10.1090/S0025-5718-1962-0144828-9 J. R. Howell, "Algorithm 87: Permutation generator," Comm. ACM, v. 5, 1962, p. 209.
- D. H. Lehmer, Teaching combinatorial tricks to a computer, Proc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, pp. 179–193. MR 0113289
- E. S. Page and L. B. Wilson, An introduction to computational combinatorics, Cambridge Computer Science Texts, vol. 9, Cambridge University Press, New York, 1979. MR 561109
- Robert Sedgewick, Permutation generation methods, Comput. Surveys 9 (1977), no. 2, 137–164. MR 464682
Additional Information
- © Copyright 1984 American Mathematical Society
- Journal: Math. Comp. 43 (1984), 565-572
- MSC: Primary 05A05
- DOI: https://doi.org/10.1090/S0025-5718-1984-0758204-3
- MathSciNet review: 758204