hash table chaining
Given input {5, 86, 35, 67, 99, 48, 6, 15, 59} and a hash function h(x) =x mod 7,?
show the resulting:
•Chaining hash table.
•Open addressing hash table using linear probing.
•Open addressing hash table using quadratic probing.
First, grab a calculator, and follow along. I’ll be answering this in parts –AS TIME PERMITS.
input {5,86,35,67,99,48,6,15,59}
h(x) = x mod 7
so, your hashes are:
{5,2,0,4,4,6,6,1,3}
Notice that 4 entries collide: 67 with 99, and 48 with 6. Chaining:
hash | value, chain pointer
table
0 -> 35
1 -> 15
2 -> 86
3 -> 59
4 -> 67 -> 99
5 -> 5
6 -> 48 -> 6
I have to leave this for now, but will try to return. If this puts you on the right path, let me know.
Sorry, I probably WON’T have time to complete B and C of your solution.
Jesse ad Freya- HashTable
