Skip to main content
Log in

Generating a random cyclic permutation

  • Part II Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We prove correct an algorithm that, givenn>0, stores in arrayb[0..n−1] a random cyclic permutation of the integers in 0..n−1, with each cyclic permutation having equal probability of being stored inb. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Sattolo,An algorithm to generate a random cyclic permutation, IPL 22 (May 1986), 315–317.

    Google Scholar 

  2. C. Berge,Principles of Combinatorics, Academic Press, New York and London, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to Peter Naur on the occasion of his 60th birthday

This research was supported by the NSF under grant DCR-8320274.

Visiting Cornell from the Computer Science Department, Jiangxi Normal University, Nanchang, People's Republic of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gries, D., Xue, J. Generating a random cyclic permutation. BIT 28, 569–572 (1988). https://doi.org/10.1007/BF01941134

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR categories

Navigation