Description
Is there an existing issue for this?
- I have searched the existing issues
Feature Description
I propose adding the Knuth-Morris-Pratt (KMP) Algorithm implementation in C++ to the DSA (Data Structures and Algorithms) folder. This algorithm is crucial for efficient substring searching and pattern matching, providing a robust solution for such tasks.
Use Case
This feature would enhance my use of the project by offering a reliable and efficient substring search algorithm ready for use. For example, in applications where quick and efficient string matching is essential, such as text processing, bioinformatics, or data parsing, the KMP algorithm would significantly improve performance.
Benefits
A specific scenario where this feature would be beneficial is in a text editor application that requires searching for occurrences of a substring within a large document. Using the KMP algorithm would ensure that searches are performed quickly, even with large datasets, enhancing user experience and application responsiveness.
Add ScreenShots
No response
Priority
High
Record
- I have read the Contributing Guidelines
- I'm a GSSOC'24 contributor
- I have starred the repository