Tompkins–Paige 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(n)$ auxiliary words (Keeps track of auxiliary counting array) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1956 == Reference == https://mathscinet.ams.org/mathscinet-getitem?mr=0080380") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ words | ||
(Keeps track of auxiliary counting array) | (Keeps track of auxiliary counting array) | ||
Latest revision as of 08:41, 10 April 2023
Time Complexity
$O(n)$ on specific permutations
Space Complexity
$O(n)$ words
(Keeps track of auxiliary counting array)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1956