search

ajay-dhangar / algo

This repository contains a collection of data structures and algorithms implemented in various programming languages. It is designed to help learners understand key concepts through hands-on examples. Contributions and improvements are welcome!
https://ajay-dhangar.github.io/algo/
MIT License
70 stars 223 forks source link

[Feature]: Want to add doc. for Rabin-Karp Algorithm #1842

Closed Jivan052 closed 3 weeks ago

Jivan052 commented 3 weeks ago

Feature Name

Rabin-Karp Algorithm

Feature Description

The Rabin-Karp algorithm is a string search algorithm that uses hashing to find any one of a set of pattern strings in a text. It calculates a hash value for the pattern and uses it to compare with hash values of substrings in the text, allowing for efficient searching, especially when multiple patterns need to be found.

Motivation

The Rabin-Karp algorithm enhances our algorithm library by providing an efficient method for substring searching. Its average-case linear time complexity allows for fast searches, especially when looking for multiple patterns in large texts. This scalability is crucial for applications in data processing, text analysis, and natural language processing. By adding this algorithm, we empower users with a versatile tool that improves performance and productivity in various real-world applications.

Implementation Suggestions (Optional)

No response

Feature Type

New Algorithm

Does this feature require additional resources?

References (Optional)

https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/

Jivan052 commented 3 weeks ago

@ajay-dhangar assign this issue to me