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 was wondering whether the brute force algorithm for pattern matching would have a complex correctness argument?
I was thinking of something along the lines of… If the algorithm is executed fully, this proves its correctness, as each character in the pattern is matched individually to an index in the text string.
Would it be as simple as this?
In general the argument for correctness of a brute-force matching algorithm would be that in the course of its execution it considers every possible way that a string could match a pattern and nothing else; thus if it concludes that the string matches then there is a matching, and if it doesn’t then there isn’t.