Skip to content

The Rabin-Karp Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a hash function to compare the pattern string and substrings of the text string and only performs a full string comparison when a hash match is found.

Notifications You must be signed in to change notification settings

darian-catalin-cucer/rabin-karp-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

rabin-karp-algorithm

The Rabin-Karp Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a hash function to compare the pattern string and substrings of the text string and only performs a full string comparison when a hash match is found.

About

The Rabin-Karp Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a hash function to compare the pattern string and substrings of the text string and only performs a full string comparison when a hash match is found.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages