Optimization and Implementation of Sunday Algorithm

String matching algorithm plays an important role in many applications such as data retrieval, network content audit, multi-protocol recognition and so on. An improved algorithm is proposed for string matching based on the discussions of several common string matching algorithms. The algorithm adds suffix comparison before the start of comparing to reduce the times of attempts and increases the average moving step. In this case, it improves the matching efficiency. In the end, the analysis of this algorithm's performance and the comparisons of the testing results of several matching algorithms are given. The experimental results show that Insunday algorithm is the most efficient of several algorithms tested. In the same case, the number of matching times of Insunday algorithm is reduced by 62.67% compared with Sunday algorithm, and it can significantly improve the efficiency of string matching.