Wells ( 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)-sized array for t_k's necessary)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1961

Reference

https://www.jstor.org/stable/2004229#metadata_info_tab_contents