article

Free access

Algorithm 202: generation of permutations in lexicographical order

Author:

Mok-Kong ShenAuthors Info & Claims

Communications of the ACM, Volume 6, Issue 9

Page 517

https://doi.org/10.1145/367593.367601

Published: 01 September 1963 Publication History

PDF eReader

Cited By

View all

Berry KJohnston JMielke PBerry KJohnston JMielke P(2014)1960–1979A Chronicle of Permutation Statistical Methods10.1007/978-3-319-02744-9_4(199-274)Online publication date: 6-Mar-2014
https://doi.org/10.1007/978-3-319-02744-9_4
Monahan J(2011)Sorting and Fast AlgorithmsNumerical Methods of Statistics10.1017/CBO9780511977176.016(403-438)Online publication date: 1-Jun-2011
https://doi.org/10.1017/CBO9780511977176.016
Soto MMirman R(1985)Remark on algorithm permComputer Physics Communications10.1016/0010-4655(85)90061-X34:4(337-338)Online publication date: Mar-1985
https://doi.org/10.1016/0010-4655(85)90061-X
Show More Cited By

Algorithm 202: generation of permutations in lexicographical order
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Generation of permutations in lexicographical order
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 ...
On the combinatorics of derangements and related permutations
Highlights
- Provide a bijection combinatorial proof for the facts that The number of derangements of length n equals the number of permutations of length n that have ...
Abstract
A derangement is a permutation in which no entry is at its original position. The number of derangements of [ n ] is called the “derangement number” or “de Montmort number”, and is denoted by D n. The sequence { D n } enumerates, in ...
Certification of algorithm 202 [G6] generation of permutations in lexicographical order

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 6, Issue 9

Sept. 1963

187 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/367593

Editor:
C. C. Gotlieb
Univ. of Toronto, Toronto, Ont., Canada

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1963

Published in CACM Volume 6, Issue 9

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
311
Total Downloads

Downloads (Last 12 months)66
Downloads (Last 6 weeks)11

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Berry KJohnston JMielke PBerry KJohnston JMielke P(2014)1960–1979A Chronicle of Permutation Statistical Methods10.1007/978-3-319-02744-9_4(199-274)Online publication date: 6-Mar-2014
https://doi.org/10.1007/978-3-319-02744-9_4
Monahan J(2011)Sorting and Fast AlgorithmsNumerical Methods of Statistics10.1017/CBO9780511977176.016(403-438)Online publication date: 1-Jun-2011
https://doi.org/10.1017/CBO9780511977176.016
Soto MMirman R(1985)Remark on algorithm permComputer Physics Communications10.1016/0010-4655(85)90061-X34:4(337-338)Online publication date: Mar-1985
https://doi.org/10.1016/0010-4655(85)90061-X
Sedgewick R(1977)Permutation Generation MethodsACM Computing Surveys10.1145/356689.3566929:2(137-164)Online publication date: 1-Jun-1977
https://dl.acm.org/doi/10.1145/356689.356692
Roy M(1973)Remark on Algorithm 323: Generation of Permutations in Lexicographic Order [G6]Communications of the ACM10.1145/362342.36236916:9(577-578)Online publication date: 1-Sep-1973
https://dl.acm.org/doi/10.1145/362342.362369
Sethi R(1973)A note on implementing parallel assignment instructionsInformation Processing Letters10.1016/0020-0190(73)90024-02:4(91-95)Online publication date: Oct-1973
https://doi.org/10.1016/0020-0190(73)90024-0
Harada K(1972)Sequential Permutation NetworksIEEE Transactions on Computers10.1109/T-C.1972.22354321:5(472-479)Online publication date: 1-May-1972
https://dl.acm.org/doi/10.1109/T-C.1972.223543

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Generation of permutations in lexicographical order

On the combinatorics of derangements and related permutations

Certification of algorithm 202 [G6] generation of permutations in lexicographical order

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations