data structures - ADT key-concepts for implementing a hash table -
i need advice implementing hash table structure. i've researching something, external opinions. thanks!
whatever hash function choose have fullfil following requirements:
- provide uniform distribution of hash values: non-uniform distribution increase amount of collisions between mapped values.
- good schema collision resolution: it's impossible avoid them, have implement strategies such "separate chaining" or "open addressing". starting point http://task3.cc/44/hash-maps-with-linear-probing-and-separate-chaining/.
Comments
Post a Comment