how does linear probing handle this?
Posted
by
Weadadada Awda
on Stack Overflow
See other posts from Stack Overflow
or by Weadadada Awda
Published on 2012-12-08T05:00:16Z
Indexed on
2012/12/08
5:03 UTC
Read the original article
Hit count: 464
• the hash function: h(x) = | 2x + 5 | mod M
• a bucket array of capacity N
• a set of objects with keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 (to input from left to right)
4.a [5 pts] Write the hash table where M=N=11 and collisions are handled using linear probing.
So I got up to here
x x x x x 44 88 12 23 13 94
but the next variable should go after the 94 now, (the 11) but does it start from the beggining or what? thx
© Stack Overflow or respective owner