Understanding string search algorithms can be a challenge. To gain a deeper insight into these algorithms, it's crucial to not only understand their underlying principles but also trace their step-by-step execution. This project aims to help visualize some of the popular string search algorithms, making it easier to grasp their inner workings. In particular, we dive deep into the following three algorithms: brute-force, Knuth-Morris-Pratt (KMP), and Rabin-Karp.
Fork this repository and clone it locally. Once completed, follow these steps:
npm installnpm run dev
If you have any questions or want to contribute, feel free to reach out to dohj0109@seas.upenn.edu!