Talk:Rabin–Karp algorithm: Difference between revisions

Content deleted Content added
Line 197:
 
The whole article reads like a popular magazine article.
 
The text says: ''this algorithm is only similar to the true number in a non-decimal system representation...'' How can an algorithm be similar to a number? True number of what??
 
The text says: ''The hash function described here is not a Rabin fingerprint, but it works equally well.'' It does NOT work equally well; in fact it uses a rather poorly chosen prime number. A Rabin fingerprint is carefully designed to reduce collisions to a minimum, possibly to zero. The chosen hash function certainly does not.