Code for the FJS String Matching Algorithm

Example implementations, in C and Java, of the Franek-Jennings-Smyth string matching algorithm. This is the fastest known algorithm for finding all occurrences of a pattern string within a text string under a wide variety of conditions.