feat: Implement Raita Algorithm for string matching #651
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implement Raita Algorithm for String Matching
Description
This PR adds the Raita Algorithm to the
pydatastructs.strings.algorithms
module. The Raita algorithm is a variation of the Boyer-Moore algorithm and is efficient for single pattern matching with an average-case complexity of O(n + m).Changes
_raita
function topydatastructs/strings/algorithms.py
.find
function to include theraita
algorithm.tests/test_strings.py
.Fixes: #650