Q42
Which algorithm is well-suited for string matching when dealing with long and complex patterns?
A.
Boyer-Moore
AnswerB.
Knuth-Morris-Pratt (KMP)
C.
Rabin-Karp
D.
Naive Search
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board