Steinhaus–Johnson–Trotter algorithm
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alternativeName |
gptkb:Johnson–Trotter_algorithm
plain changes algorithm |
| gptkbp:complexity |
O(n!)
|
| gptkbp:field |
gptkb:combinatorics
computer science |
| gptkbp:introducedIn |
1962
|
| gptkbp:namedAfter |
gptkb:Hugo_Steinhaus
gptkb:H._F._Trotter gptkb:Selmer_M._Johnson |
| gptkbp:output |
all permutations of n elements
|
| gptkbp:property |
generates permutations by transpositions of adjacent elements
|
| gptkbp:purpose |
generating permutations
|
| gptkbp:relatedTo |
gptkb:Gray_code
permutation generation |
| gptkbp:step |
adjacent transposition
|
| gptkbp:bfsParent |
gptkb:Hugo_Steinhaus
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Steinhaus–Johnson–Trotter algorithm
|