This paper is an attempt to develop a string searching algorithm that begins the search for a match in the middle of the strings being compared. The algorithm uses information gained from mismatches and the location of the search area in the large string, to make decisions and direct the search. Several elements of this algorithm can be useful in string searching applications. The algorithm is developed in FORTRAN IV (IBM [email protected]?145), and the entire program is written in modular replacement form so that modification can be efficient.