Q17
Which algorithm is considered to be the fastest for string matching in practice, especially for large texts?
A.
Rabin-Karp
B.
Knuth-Morris-Pratt (KMP)
C.
Naive Search
D.
Boyer-Moore
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board