Shuffling and Permutation Generation Algorithms

Algorithms that put a sequence into a random order or list every ordering of a set, such as the Fisher-Yates shuffle, Heap's algorithm and the Steinhaus-Johnson-Trotter algorithm. An algorithm belongs here when its cited article says it shuffles a sequence or generates permutations. It excludes algorithms that sort a sequence into order. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.