darian-catalin-cucer / pattern-matching-algorithms

Pattern matching algorithms search for occurrences of a pattern in a larger text. They have a wide range of applications, including data compression, data mining, and bioinformatics. There are several pattern matching algorithms available, including the naive algorithm, the Knuth-Morris-Pratt (KMP) algorithm, and the Boyer-Moore algorithm.

Pattern Matching Algorithms Android App

An open-source Android application that implements various pattern matching algorithms in Kotlin.

Features

• User-friendly interface for inputting text and search patterns
• Implements algorithms such as Knuth-Morris-Pratt, Rabin-Karp, and regular expression matching
• Option to compare the performance of the algorithms with different text and pattern inputs
• Can be used by students, computer scientists, and software engineers alike

Getting Started

1. Clone the repository: git clone https://github.com/cucerdariancatalin/PatternMatchingAlgorithms.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.