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.

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

Plagiarism Detection :: Patten Matching by hashing - Rabin Karp Algorithm #160

Open
Abhijit2505 opened this issue Sep 29, 2021 · 4 comments

Comments

@Abhijit2505
Copy link
Member

Wikipedia Says,

In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string-searching algorithm created by Richard M. Karp and Michael O. Rabin (1987) that uses hashing to find an exact match of a pattern string in a text. It uses a rolling hash to quickly filter out positions of the text that cannot match the pattern, and then checks for a match at the remaining positions. Generalizations of the same idea can be used to find more than one match of a single pattern, or to find matches for more than one pattern.

Read more about the algorithm here.

Acceptance Condition

  • Code is written with proper mentions of edge cases
  • Well commented code
  • Well documentation(refer to codebase)
@pawankm21
Copy link
Contributor

I would like to work on this issue

@Abhijit2505
Copy link
Member Author

@pawankm21 please get started.

@pawankm21
Copy link
Contributor

yeah, on it.

@vacom13
Copy link

vacom13 commented Nov 10, 2021

@Abhijit2505 Has this been worked on? If not could I take it up?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants