Rabin Karp Substring Search Pattern Matching

Published: 30 December 2015
on channel: Tushar Roy - Coding Made Simple

250,777

/ tusharroy25
https://github.com/mission-peace/inte...
https://github.com/mission-peace/inte...
https://github.com/mission-peace/inte...

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 any one of a set of pattern strings in a text. For text of length n and p patterns of combined length m, its average and best case running time is O(n+m) in space O(p), but its worst-case time is O(nm). In contrast, the Aho–Corasick string matching algorithm has asymptotic worst-time complexity O(n+m) in space O(m).

On this page of the site you can watch the video online Rabin Karp Substring Search Pattern Matching with a duration of online in good quality, which was uploaded by the user Tushar Roy - Coding Made Simple 30 December 2015, share the link with friends and acquaintances, this video has already been watched 250,777 times on youtube and it was liked by 3 thousand viewers. Enjoy your viewing!