java - How do HashTables deal with collisions? - Stack Overflow
When you talked about "Hash Table will place a new entry into the 'next available' bucket if the new Key entry collides with another.", you are talking about the Open addressing strategy of Collision resolution of hash table.
There are several strategies for hash table to resolve collision.
First kind of big method require that the keys (or pointers to them) be stored in the table, together with the associated values, which further includes:
- Separate chaining
Read full article from java - How do HashTables deal with collisions? - Stack Overflow
No comments:
Post a Comment