Data Structures and Algorithms in Kotlin
-
Updated
Nov 25, 2019 - Kotlin
Data Structures and Algorithms in Kotlin
The Knuth-Morris-Pratt (KMP) Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a preprocessing step to create a failure function to improve efficiency, making the KMP algorithm faster than other basic string matching algorithms.
Add a description, image, and links to the kmp-matcher topic page so that developers can more easily learn about it.
To associate your repository with the kmp-matcher topic, visit your repo's landing page and select "manage topics."