Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Raita Algorithm for String Matching #650

Open
asmit27rai opened this issue Mar 17, 2025 · 1 comment · May be fixed by #651
Open

Raita Algorithm for String Matching #650

asmit27rai opened this issue Mar 17, 2025 · 1 comment · May be fixed by #651

Comments

@asmit27rai
Copy link

Implement Raita Algorithm for String Matching

Description:
The Raita algorithm is a variation of the Boyer-Moore algorithm that uses a different heuristic for shifting the pattern. It is efficient for single pattern matching and has an average-case complexity of O(n + m), where n is the length of the text and m is the length of the pattern.

This issue involves implementing the Raita algorithm in the pydatastructs.strings.algorithms module and adding corresponding test cases.
@asmit27rai
Copy link
Author

@Kishan-Ved I am working on this issue..

@asmit27rai asmit27rai linked a pull request Mar 17, 2025 that will close this issue
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

feat: Implement Raita Algorithm for string matching asmit27rai/pydatastructs
1 participant
@asmit27rai