Steinhaus-Johnson-Trotter algorithm
From Wikipedia, the free encyclopedia
The Steinhaus-Johnson-Trotter algorithm or Johnson-Trotter algorithm is an algorithm which generates permutations by transposing elements.
[edit] See also
- Fisher-Yates shuffle
[edit] External links
- Implentation of the Steinhaus-Johnson-Trotter algorithm
- Counting And Listing All Permutations: Johnson-Trotter Method at cut-the-knot
[edit] References
- Paul E. Black, Johnson-Trotter at the NIST Dictionary of Algorithms and Data Structures.
