title: When is Rabin Karp more effective than KMP or Boyer-Moore?
body: <p>I'm learning about string searching algorithms and understand how they work but haven't found a good enough answer about in which cases Rabin-Karp algorithm would be more effective than KMP or Boyer-Moore. I see that it is easier to implement and doesn't need the same overhead but beyond that, I have no clue.</p>
  
  <p>So, when is Rabin-Karp better to use than the others?</p>