Langdon ( All permutations)

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)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1967

Reference

https://dl.acm.org/doi/pdf/10.1145/363282.363315