Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Please help me to understand Boyer-Moore string search algorithm’s “Good Suffix Shift”-Table.
What has happened when i==3?
There is no sub-string “_MAN” in the pattern. So the shift value should be 8 (as it was when i==1).
Why is it 6?
There is no sub-string “_MAN”, but the string does start with “AN”, so if you shift over by 6 you could get a pattern that matches as follows