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.
I understand the algorithm of pattern matching with a Text T of length n and a Pattern P of length m is linear using the witness table algorithm.
I also know how to construct the witness table in m^2 time but there is an algorithm of O(m) for constructing the table that I don’t understand.
Please help.
maybe you meant this Part I Part II – Correctness
By Amihood Amir
Professor of Computer Science.
(This data is not mine).