Ives' algorithm c ( All permutations)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1})$ per permutation == Space Complexity == $O(n)$ auxiliary words (O(n) words needed to keep track of which elements have cycled how many times) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/359997.360002")
Time Complexity
$O({1})$ per permutation
Space Complexity
$O(n)$ auxiliary words
(O(n) words needed to keep track of which elements have cycled how many times)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1976
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/359997.360002