Abstract: Let m be the number of characters in the pattern, and let n be the number of characters in the text. The expected complexity of the algoritm presented in this paper is O (mlog:n). The main idea of the algorithm is a reasonable cutting pattern. Every part of the pattern is matched with the text after cutting pattern The olgorithm fits the match for finding repeatedly different pattern in the text.