Implements several String Matching Algorithms
String matching is a problem where a given pattern of length m has to be searched in a given text of size n, and if the text contains the pattern, the first matching index i has to be returned.
| Class : StringMatching |
|---|
| Description : Static container for several String Matching Algorithms |
+HorsePool(text:string,pattern:string):int |
+BruteForce(text:string,pattern:string):int |
+BoysMore(text:string,pattern:string):int |
In UML Class Diagram above bold represents static members, actually they have to be underlined, since github markdown doesn't support underline, bold is used
All UML Class Diagrams will be replaced by their Image equivalents soon