Jump to content

Steinhaus–Johnson–Trotter algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ruud Koot (talk | contribs) at 16:38, 29 August 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Steinhaus-Johnson-Trotter algorithm or Johnson-Trotter algorithm is an algorithm which generates permutations by transposing elements.

See also

References

  • Public Domain This article incorporates public domain material from Paul E. Black. "Johnson-Trotter". Dictionary of Algorithms and Data Structures. NIST.
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Steinhaus–Johnson–Trotter_algorithm&oldid=22108782"