VOOZH about

URL: https://link.springer.com/article/10.1007/BF01937486?error=cookies_not_supported&code=6e90dcee-45ba-46f4-8648-07a835cfd5e1

⇱ A new algorithm for generation of permutations | BIT Numerical Mathematics | Springer Nature Link

Skip to main content

A new algorithm for generation of permutations

  • Part I Computer Science
  • Published:

Abstract

A new algorithm for generating permutations is presented, that generates the next permutation by reversing a certain suffix of its predecessor. The average size of this suffix is less thane ≅ 2.8. It is shown how to find the position of a given permutation and how to construct the permutation of a given position, where the position refers to the order in which the permutations are generated, and is also new.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. N. Dershowitz,A simplified loop-free algorithm for generating permutations, BIT 15 (1975), 158–164.

    Google Scholar 

  2. G. Ehrlich,Loopless algorithm for generating permutations, combinations and other combinatorial configurations, J. ACM 20, 3 (1973), 500–513.

    Google Scholar 

  3. G. Ehrlich,Algorithm 466, Permu., Comm. ACM 16, 11 (1973), 690–691.

    Google Scholar 

  4. S. Even,Algorithmic Combinatorics, Macmillan, New York, (1973), 2–11.

    Google Scholar 

  5. W. H. Gates and C. H. Papadimitriou,Bounds for sorting by prefix reversals, Discrete Mathematics 27 (1979), 47–57.

    Google Scholar 

  6. S. M. Johnson,Generation of permutations by adjacent transpositions, Math. Comput. 17 (1963), 282–285.

    Google Scholar 

  7. E. M. Reingold, J. Nievergelt and N. Deo,Combinatorial Algorithms, Prentice-Hall, New Jersey, (1977), 161–171.

    Google Scholar 

  8. R. Sedgewick,Permutation generation methods, Computing Surveys, 9, 2 (1977), 137–164.

    Google Scholar 

  9. H. F. Trotter,Algorithm 115, Perm., Comm. ACM 5, 8 (1962), 434–435.

    Google Scholar 

  10. American Mathematical Monthly 82, 1 (1975), 1010.

  11. American Mathematical Monthly 84, 4 (1977), 296.

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, M.I.T., 02139, Cambridge, MA, U.S.A.

    Shmuel Zaks

Authors
  1. Shmuel Zaks

Additional information

On leave from the Department of Computer Science, Technion, Haifa, Israel. This work was supported by NSF grant MCS-8302391.

About this article

Cite this article

Zaks, S. A new algorithm for generation of permutations. BIT 24, 196–204 (1984). https://doi.org/10.1007/BF01937486

Download citation

  • Received:

  • Revised:

  • Issue date:

  • DOI: https://doi.org/10.1007/BF01937486

Keywords