Q26
In which scenario is the Naive string matching algorithm the least efficient?
A.
When the pattern and text are very long.
AnswerB.
When the pattern is very short.
C.
When the text is sorted.
D.
When there are many matches in the text.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board