String Matching

In this project five string matching algorithms are implemented and tested. The algorithms are:  Boyer-Moore matcher, Boyer-Moore find longest repeating pattern the Knuth-Morris-Pratt matcher, naïve matcher, and the Rabin-Karp matcher. The best algorithm appears to be the first.

C# (147.8 KB)
286 times
Add to favorites
E-mail Twitter Digg Facebook

Solution explorer

Click an item in the panel on the left to view the contents here.