Steinhaus–Johnson–Trotter algorithm
an algorithm that generates all permutations of a finite set
Facts
2 properties- Instance of
- combinatorial algorithm, mathematical concept[2]
- Named after
- Hale F. Trotter, Hugo Steinhaus, Selmer M. Johnson[3][4][5]
🏷️ Also known as
en Johnson–Trotter algorithm
en plain changes
en Steinhaus–Johnson–Trotter algorithm
de Steinhaus-Johnson-Trotter-Algorithmus
el Αλγόριθμος Στάινχαους-Τζόνσον-Τρότερ
es algoritmo de Steinhaus-Johnson-Trotter
fa الگوریتم استینهوس-جانسون-تروتر
it algoritmo di Steinhaus-Johnson-Trotter
ko 스테인하우스-존슨-트로터 알고리즘
pt algoritmo de Steinhaus–Johnson–Trotter
ru Алгоритм Джонсона — Троттера
th ขั้นตอนวิธีของชไตน์เฮาส์ จอห์นสันและทร็อทเทอร์
🔖 Identifiers · 4
- Image (Wikimedia Commons)
- Symmetric group 4; Cayley graph 1,2,6 (3D); Steinhaus–Johnson–Trotter.svg ↗
- Dictionary of Algorithms and Data Structures ID
- johnsonTrotter
- Freebase ID
- /m/07nm5d
- Microsoft Academic ID (discontinued)
- 176569495
Press Enter · cited answer in seconds
0 sources
Summary
Steinhaus–Johnson–Trotter algorithm is a combinatorial algorithm[1].
Body
History and Context
Things named after include Hale F. Trotter[3], a mathematician[6], 1931–2022[7], of Canada[8], specialised in mathematics[9]; Hugo Steinhaus[4], a mathematician[10], 1887–1972[11], of Cisleithania[12], awarded the Commander with Star of the Order of Polonia Restituta[13], specialised in probability theory[14]; and Selmer M. Johnson[5], a mathematician[15], 1916–1996[16], of United States[17].