summaryrefslogtreecommitdiff
path: root/string/string.tex
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-05 21:51:20 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-05 21:51:20 +0100
commitad3856a6b766087df0036de0b556f4700a6498c9 (patch)
tree78037d83b823feee3f73d6594d6039442d7ca525 /string/string.tex
parentcfb19a7085895cdbcf09c123c37735586dbe7695 (diff)
parent8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (diff)
merge mzuenni changes
Diffstat (limited to 'string/string.tex')
-rw-r--r--string/string.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/string/string.tex b/string/string.tex
index fe8e40c..4b8a880 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}