Scribd
Upload
374 views

Durstenfeld - Random Permutation Algorithm

This is Algorithm 235, Random Permutation, from the Collected Algorithms of the ACM, Vol. II, 2 Jan 1964. It is Richard Durstenfeld's Algol implementation of a random permutation generator. The running time is O(n) for a permutation of size n and uses no extra memory. It is the first (and only?) optimal random permutation generator. Contrary to folklore, this was a new algorithm and not merely a computer version of the Fisher-Yates method, 1938.

Uploaded by

Derek O'Connor
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
374 views

Durstenfeld - Random Permutation Algorithm

This is Algorithm 235, Random Permutation, from the Collected Algorithms of the ACM, Vol. II, 2 Jan 1964. It is Richard Durstenfeld's Algol implementation of a random permutation generator. The running time is O(n) for a permutation of size n and uses no extra memory. It is the first (and only?) optimal random permutation generator. Contrary to folklore, this was a new algorithm and not merely a computer version of the Fisher-Yates method, 1938.

Uploaded by

Derek O'Connor
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy