| Hash Functions |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | But
the most simple AND most effective approach for |
|||||||||||||
| hashing
is to use modulo arithmetic (finding an integer |
||||||||||||||
| remainder
after a division). |
||||||||||||||
| • | All
we need to do is use a hash function like: |
|||||||||||||
| – | employee
id # % Tablesize |
|||||||||||||
| – | 566-99-3411
% 101 results in a remainder of 15 |
|||||||||||||
| • | This
type of hash function will always map our |
|||||||||||||
| numbers
to range WITHIN the range of the |
||||||||||||||
| table.
In this case, the results will always range |
||||||||||||||
| between
0 and 100! |
||||||||||||||