Definition: A permutation algorithm, or shuffle, that has exactly the same chance of producing any permutation.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
Note: Attaching random tags then sorting (see permutation) may not work: if tags may be duplicated, a deterministic sort will not randomly switch the order of elements with duplicate tags.
Formerly called "perfect shuffle". Renamed in January 2009 when Dave Bayer pointed out that the term is almost universally used to mean dividing a list of elements (or deck of cards) exactly in half then precisely interleaving the two halves. This has been the use of "perfect shuffle" for decades.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 27 December 2010.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "ideal random shuffle", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 27 December 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/idealRandomShuffle.html