Rabin–Karp string matching ⚡
While exploring about hash functions, I came across an interesting algorithm: Rabin–Karp string matching ⚡
Did you know? Editors like VSCode (or any text search) often use this to find patterns in O(n + m) time instead of O(n·m) brute force.
n → text length
m → pattern length
Your upvotes and feedback are welcome!
Words have more power than we think. Be kind.