Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01919664n
Noun Concept
Categories: Combinatorial algorithms, Permutations
EN
Steinhaus–Johnson–Trotter algorithm  Johnson-Trotter  Johnson-Trotter algorithm  Johnson–Trotter  Johnson–Trotter algorithm
EN
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of n {\displaystyle n} elements. Wikipedia
Definitions
Relations
Sources
EN
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of n {\displaystyle n} elements. Wikipedia
NAMED AFTER
Selmer M. Johnson
Hugo Steinhaus
Hale Trotter
Wikipedia
EN
Steinhaus–Johnson–Trotter algorithm
Wikidata
EN
Steinhaus–Johnson–Trotter algorithm
Wikipedia Redirections
EN
Johnson-Trotter, Johnson-Trotter algorithm, Johnson–Trotter, Johnson–Trotter algorithm, plain changes, Steinhaus-Johnson-Trotter, Steinhaus-Johnson-Trotter algorithm
Wikidata Alias
EN
Johnson–Trotter algorithm, plain changes

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License