diff options
| author | MZuenni <michi.zuendorf@gmail.com> | 2024-06-28 14:54:23 +0200 |
|---|---|---|
| committer | MZuenni <michi.zuendorf@gmail.com> | 2024-06-28 14:54:23 +0200 |
| commit | 9e8344e44eb06ac4a8618413ff2b2311c6348dad (patch) | |
| tree | 695cfb3f614ec9f36a0a922a403dc1a0d0b5b169 /string | |
| parent | 65d2ac37862ce9d1de208a05099c281863e66256 (diff) | |
polishing
Diffstat (limited to 'string')
| -rw-r--r-- | string/string.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/string/string.tex b/string/string.tex index 393c2ad..dbea36c 100644 --- a/string/string.tex +++ b/string/string.tex @@ -35,7 +35,7 @@ \begin{algorithm}{\textsc{Manacher}'s Algorithm, Longest Palindrome} \begin{methods} \method{init}{transformiert \code{string a}}{n} - \method{manacher}{berechnet Länge der Palindrome}{n} + \method{manacher}{berechnet Längen der Palindrome in longest}{n} \end{methods} \sourcecode{string/manacher.cpp} \end{algorithm} @@ -90,7 +90,7 @@ \begin{algorithm}{Suffix-Array} \begin{methods} \method{SuffixArray}{berechnet ein Suffix Array}{\abs{s}\*\log^2(\abs{s})} - \method{lcp}{berechnet den longest common prefix}{\log(\abs{s})} + \method{lcp}{berechnet Länge des longest common prefix}{\log(\abs{s})} \method{}{von \code{s[x]} und \code{s[y]}}{} \end{methods} \sourcecode{string/suffixArray.cpp} |
