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’ve recently been trying to investigate the various ways to do substring searches and have stumbled upon the following article http://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_string_search_algorithm. I was wondering if there are any other common/efficient algorithms out there that anyone can suggest/show?
Thanks much
The most obvious would be Boyer-Moore or some variant such as Boyer-Moore-Horspool. For some situations, it’s also worth considering Knuth-Morris-Pratt.