Steinhaus–Johnson–Trotter algorithm (All Permutations All Permutations): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:1511:15, 15 February 2023‎ Admin talk contribs‎ 430 bytes +430‎ Created page with "== Time Complexity == $O(n)$ on specific permutations == Space Complexity == $O({1})$ auxiliary words (Determining $x_i$ and $y_i$ each iteration can be done in constant space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1963 == Reference == https://www.ams.org/journals/mcom/1963-17-083/S0025-5718-1963-0159764-2/home.html"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Steinhaus–Johnson–Trotter_algorithm_(All_Permutations_All_Permutations)"