Hash Table with Rehashing

um...could find nowhere for this

so thought COmputers...troubleshooting.

Can some please help...how does rehashing work...i can't really find a detailed explanation in the notes, nor can really on a hash table with chaining...

I understand how the hash table works in the basic form...but not the little extras...(although i do know chaining thanks to planty).

Thanks

Fry

you know how you do some hash operation to gain the hash number of the entry. rehashing works by checking if there is already and entry in the location for the new entry, if there is, do a rehashing operation on the hash key to find its new location.

Yeh, this process then repeats until the function finds a free space

and if you get to the end of the table?

Blue screen out of it and blame the user.

ah the windows approach

Pipboy_3000 wrote:and if you get to the end of the table?

Then re-write your hash function

depending on the language implmentation, the hash table could be dynamically allocated memory, for example the hashtable in java.util, some simple methods for resolving collisions (rehashing?) are linear probing or quadratic probing I think.

bit late there the exam is over!

he's not in our uni, stef...