Can anyone suggest me a worst case “text string – pattern pair” for testing a KMP algorithm implementation?
Share
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.
Can anyone suggest me a worst case “text string – pattern pair” for testing a KMP algorithm implementation?
I would say a pattern like
and a string like
would be one of the worst cases, but it’s still
O(m+n)