Definition: A rearrangement of elements, where none are lost, added, or changed. The Fisher-Yates shuffle randomly permutes elements.
Also known as shuffle.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
ideal random shuffle, Fisher-Yates shuffle, Johnson-Trotter, sort, derangement.
Aggregate parent (I am a part of or used in ...)
American flag sort.
See also pseudo-random number generator.
Note: A sort is a permutation where the items are arranged in some order. A derangement is a permutation where no item is in its original position.
There are n! permutations of n (distinguishable) elements.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 6 May 2019.
HTML page formatted Mon May 6 10:22:33 2019.
Cite this as:
Paul E. Black, "permutation", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 May 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/permutation.html