Langdon ( All permutations)
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ per permutation == Space Complexity == $O({1})$ auxiliary words (Only need the auxiliary variable N, according to the flowchart in the paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1967 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/363282.363315")
Time Complexity
$O(n)$ per permutation
Space Complexity
$O({1})$ auxiliary words
(Only need the auxiliary variable N, according to the flowchart in the paper)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1967
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/363282.363315