Steinhaus–Johnson–Trotter algorithm (All Permutations All Permutations): Difference between revisions
Jump to navigation
Jump to search
(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.ezproxy.canberra.edu.au/journals/mcom/1963-17-083/S0025-5718-1963-0159764-2/home.html") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({1})$ | $O({1})$ words | ||
(Determining $x_i$ and $y_i$ each iteration can be done in constant space) | (Determining $x_i$ and $y_i$ each iteration can be done in constant space) | ||
Latest revision as of 08:40, 10 April 2023
Time Complexity
$O(n)$ on specific permutations
Space Complexity
$O({1})$ 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