Zaks' prefix reversal algorithm ( All permutations)
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/content/pdf/10.1007/BF01937486.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://link.springer.com/article/10.1007/BF01937486")
Time Complexity
$O(n)$ on specific permutations
Space Complexity
$O(n)$ auxiliary (see NEXT algorithm in same paper) words
(https://link.springer.com/content/pdf/10.1007/BF01937486.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984