Zaks' prefix reversal algorithm ( All permutations)

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ on specific permutations == Space Complexity == $O(n)$ auxiliary (see NEXT algorithm in same paper) words (https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/BF01937486.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01937486")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$ on specific permutations

Space Complexity

$O(n)$ auxiliary (see NEXT algorithm in same paper) words

(https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/BF01937486.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1984

Reference

https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01937486

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Zaks%27_prefix_reversal_algorithm_(_All_permutations)&oldid=45645"