Ord-Smith ( 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 q (as in paper) necessary) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1967 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/362896.362913")
(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 q (as in paper) necessary)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1967

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/362896.362913

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Ord-Smith_(_All_permutations)&oldid=45643"