Using Animations to Teach String Matching Effectively
Journal of Computing Sciences in Colleges
String matching is to find a substring in a string. The algorithms commonly used for finding a matching are the brute-force algorithm, Boyer-Moore algorithm, and Knuth-Morris-Pratt algorithm. The brute-force algorithm is intuitive. The Boyer-Moore and Knuth-Morris-Pratt algorithms are more efficient than the brute-force string matching algorithm, but they are more difficult to understand than the brute-force algorithm. We have created the animations for helping instructors to teach and students to learn these algorithms. This paper presents these animations.
Liang, Y. Daniel, Lixin Li, Weitian Tong.
"Using Animations to Teach String Matching Effectively."
Journal of Computing Sciences in Colleges, 35 (10): 27-32: Association for Computing Machinery.
doi: 10.5555/3417699.3417703 source: https://dl.acm.org/doi/10.5555/3417699.3417703