Algorithm of the Week: Rabin-Karp String Searching 04.03.2012 Brute force string matching is a very basic sub-string matching algorithm, but it’s good for some reasons. For example it doesn’t require preprocessing of the text or the pattern. The problem is that it’s very slow. That is why in many cases brute force matching can’t be very useful. For pattern matching we need something faster, but to understand other sub-string matching algorithms let’s take a look once again at brute force matching.
Read full article from Algorithm of the Week: Rabin-Karp String Searching | Javalobby
No comments:
Post a Comment