最終更新日：2022/12/07
正解を見る
(computing theory) A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked.
編集履歴（0）
元となった辞書の項目
Knuth-Morris-Pratt algorithm
name
(computing
theory)
A
linear-time
algorithm
that
searches
for
occurrences
of
one
text
string
within
another,
employing
the
observation
that
when
a
mismatch
occurs,
the
search
string
itself
embodies
sufficient
information
to
determine
where
the
next
match
could
begin,
thus
reducing
the
number
of
possible
match
locations
that
must
be
checked.
意味（1）
(computing
theory)
A
linear-time
algorithm
that
searches
for
occurrences
of
one
text
string
within
another,
employing
the
observation
that
when
a
mismatch
occurs,
the
search
string
itself
embodies
sufficient
information
to
determine
where
the
next
match
could
begin,
thus
reducing
the
number
of
possible
match
locations
that
must
be
checked.
