Vidyalelo
Data Structure · Q24

String Matching

Programming · Data Structure · question 24

Q24

Which algorithm is particularly well-suited for string matching when the pattern is very short?

A.
Knuth-Morris-Pratt (KMP)
B.
Rabin-Karp
C.
Naive Search
Answer
D.
Boyer-Moore

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board