Rabin-Karp’s Algorithm: How to choose the prime number and x? · Issue #44 · hamidgasmi/training.computerscience.algorithms-datastructures · GitHub

8000 Rabin-Karp’s Algorithm: How to choose the prime number and x? · Issue #44 · hamidgasmi/training.computerscience.algorithms-datastructures · GitHub

Rabin-Karp’s Algorithm: How to choose the prime number and x? #44

Open

Open

Rabin-Karp’s Algorithm: How to choose the prime number and x?#44

Assignees

Labels

How to make the trade-off between collision numbers and performance of recurrence calculation for H[i]?

More the prime is bigger, less false positive we gets. This is supposed to make our code faster.

In the other hand, more the prime is bigger, the related division and multiplication operations get slower.

Metadata

Assignees

hamidgasmi

Labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

0