| Hash Functions |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Typically,
the larger the table the fewer |
||||||||||
| collisions.
We can control the distribution of |
|||||||||||
| table
items more evenly, and reduce collisions, |
|||||||||||
| by
choosing a prime number as the Table size. |
|||||||||||
| For
example, 101 is prime. |
|||||||||||
| • | Notice
that if the tablesize is a power of a small |
||||||||||
| integer
like 2 or 10...then many keys tend to |
|||||||||||
| map
to the same index. So, even if the hash table |
|||||||||||
| is
of size 1000...it might be better to choose 997 |
|||||||||||
| or
1009. |
|||||||||||