Scribd Logo
Upload

Welcome to Scribd!

  • 329 views

    Durstenfeld - Random Permutation Algorithm

    Uploaded by

    Derek O'Connor
    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.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Durstenfeld - Random Permutation Algorithm

    Uploaded by

    Derek O'Connor
    329 views1 page
    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.

    Original Title

    Durstenfeld -- Random Permutation Algorithm

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    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.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    329 views1 page

    Durstenfeld - Random Permutation Algorithm

    Uploaded by

    Derek O'Connor
    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.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 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