Teaching Discussion on Pattern Matching Algorithm in the Course of Data Structure

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 269)

Abstract

Pattern matching algorithm, such as KMP, is one of the most important and difficult problems in the course of data structure. In order that students could better grasp the algorithm, Algorithm KMP is analysed in detail, and relevant examples are illustrated in this article.

Keywords

Pattern matching KMP Function next Function nextval 

References

  1. 1.
    Weiss M A (2007) Data structures and algorithm analysis in C. Posts & Telecom Press, BeijingGoogle Scholar
  2. 2.
    Flaming B (1994) Practical data structures in C++. Wiley, New YorkGoogle Scholar
  3. 3.
    Sedgewick R (1990) Algorithms in C. Addison-Wesley, ReadingGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.School of ComputerWuhan UniversityWuhanChina

Personalised recommendations