摘要
模式匹配是字符串的基本运算之一,也是数据结构课程的重点算法之一。在当今文本信息海量增长的时代,如何快速地定位就显得尤为重要。该文通过朴素模式匹配算法与KMP算法的比较说明各自的优缺点,同时通过提高获取next数组的效率,加快KMP算法的匹配速率。
Patter matching is one of the basic operating of String, and is one of the key algorithm of Date Structure.In the era of massive text information, it is very important for us to quickly locate imformation. In this paper, the advantages and disadvantages between KMP and Native patter matching algorithm are compared and improve the matching rate of KMP by improving the effciency of next array.
出处
《电脑知识与技术》
2017年第6X期25-26,共2页
Computer Knowledge and Technology
基金
运城学院教学改革(项目编号:JG201636)
地方院校大学生创新创业能力和实践动手能力研究(项目编号:ZL-13024)
