Question: If Horspool's algorithm discovers a matching substring, how large a shift should it make to search for a next possible match? Group of answer choices
If Horspool's algorithm discovers a matching substring, how large a shift should it make to search for a next possible match?
Group of answer choices
The length of entire pattern
The entry value of the shift table as in the case of a mismatch
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
