| Information | |
|---|---|
| has gloss | eng: The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm is an algorithm that generates permutations by transposing elements. |
| lexicalization | eng: Steinhaus-Johnson-Trotter algorithm |
| lexicalization | eng: Steinhaus–Johnson–Trotter algorithm |
| instance of | c/Combinatorial algorithms |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint