关键词: 匹配, 模式, 串, 时间复杂度, 文本, 匹配, 模式, 串, 时间复杂度, 文本

Abstract: This paper established an improved KMPalgorithm for pattern matching in string. Tests proved that the algorithm has less comparison times and higher efficiency under the circumstances that the pattern first appears in the bottom half of a text string.

Key words: pattern, string, time complexity, text , match, pattern, string, time complexity, text