Wells ( All permutations)

From Algorithm Wiki
Revision as of 11: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)-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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Wells_(_All_permutations)&oldid=45641"