/kmp-algorithm

The Knuth-Morris-Pratt (KMP) algorithm is a linear time pattern matching algorithm that efficiently searches for occurrences of a pattern in a text. It pre-processes the pattern to determine a partial match table which is used to quickly skip over sections of the text that cannot match the pattern.

Primary LanguageKotlin

Knuth-Morris-Pratt Algorithm Android App

An open-source Android application that implements the Knuth-Morris-Pratt pattern matching algorithm in Kotlin.

Features

  • User-friendly interface for inputting text and search patterns
  • Implements the Knuth-Morris-Pratt algorithm for efficient pattern matching
  • Option to compare the performance of the algorithm with other pattern matching algorithms
  • Can be used by students, computer scientists, and software engineers alike

Getting Started

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/KMPAlgorithm.git
  2. Open the project in Android Studio
  3. Build and run the app on an emulator or physical device

Contributing

We welcome contributions to the project. If you want to contribute, please fork the repository and submit a pull request with your changes.

License

This project is licensed under the MIT License. See LICENSE for details.