Using Animations to Teach String Matching Effectively

Authors

• Y. Daniel Liang, Georgia Southern UniversityFollow
• Lixin Li, Georgia Southern UniversityFollow
• Weitian Tong, Eastern Michigan UniversityFollow

Document Type

Article

Publication Date

4-2020

Publication Title

Journal of Computing Sciences in Colleges

DOI

10.5555/3417699.3417703

ISSN

1937-4763

Abstract

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.

Comments

Copyright © 2020 ACM, Inc.

Recommended Citation

Liang, Y. Daniel, Lixin Li, Weitian Tong. 2020. "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
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/302

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.