Vidyalelo
Data Structure · Q30

String Matching

Programming · Data Structure · question 30

Q30

What is the primary advantage of the Boyer-Moore algorithm compared to the Naive Search algorithm?

A.
It always performs well regardless of pattern length.
B.
It works well for very short patterns.
C.
It skips large portions of the text, making it faster for large datasets.
Answer
D.
It uses less memory.

Answer: Option C

Solution

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