Ives' algorithm c ( All permutations)

From Algorithm Wiki
Jump to navigation Jump to search

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/doi/abs/10.1145/359997.360002