|
|
Meine Frage:
Hash the keys [13,17,39,27,1,20,4,40,25,9,2,37] into a hash table of size 13 using the division-remainder method. a) Give a suitable value for m.
b) handle collisions using linked lists andvisualize theresult in a table like this
0?
1?
2?
3?
4?
...
Meine Ideen:
a) if the table size is 13, m also have to be 13 because of remaining classes??
|
|
