一种新的串模式匹配算法

Pattern matching algorithm has been research in the field of computer search for a key project. This paper analyzes the traditional brute force string matching algorithm and enhanced the Boyer-Moore algorithm, and proposed a new matching algorithm. The algorithm to find patterns in the text string T P and the end of the first letter of letters, corresponding to the length of the same requirements, which will each find a place in the text is stored in the R array, followed by extraction of these positions, from these locations begin to match the pattern string P. For the frequently used text and pattern to match string, because the pattern stored in advance in the text string in all stored, so the match will be very fast speed. In this paper, the specific data given the results, analyze the time complexity of the algorithm.