How to implement dynamic hashing?

A

Anton Savchenko2016-04-25 11:14:45

Programming

Anton Savchenko, 2016-04-25 11:14:45

The challenge is storing, adding, deleting, and looking up data in a hash table and using dynamic hashing. What is it all about? I thought it was doubling the size of the table when it reached a certain fill factor, but as I later found out, this has nothing to do with dynamic hashing. I didn't find anything on the Internet. In the known literature on algorithms too.

Reply

Answer the question

In order to leave comments, you need to log in

1 answer(s)

P

poiuy7, 2016-04-25
@poiuy7

It looks like you were right in thinking.
For example: studopedia.org/9-31222.html
As far as I know, in JAVA the HashMap class is done just like that.
Here is its source: grepcode.com/file/repository.grepcode.com/java/roo...
Why "but, as I found out later, this has nothing to do with dynamic hashing" - ?