KMP (Knuth-Morris-Pratt) is a linear-time pattern matching algorithm that finds the occurrence of a substring within a given string.
These instructions will help you to understand the implementation of the KMP Algorithm in Kotlin language. This project contains the code for the KMP algorithm, which can be used to perform pattern matching operations on strings.
Before you begin, you should have a basic understanding of string operations, algorithms and Kotlin programming language.
To use this repository, simply clone the repository and run the code on your local machine.
To test the code, you can write test cases in the main function and run the code. You will see the output of the code, which will show you whether the KMP algorithm is working as expected.
- Kotlin
Feel free to contribute to this repository by creating pull requests or by reporting issues.
This project is licensed under the MIT License.
- Knuth, Morris, and Pratt for the KMP algorithm.