How do HashTables deal with collisions?

by

Hash tables deal with collisions in one of two ways.

Option 1: By having each bucket contain a linked list of elements that are hashed to that bucket. This is why a bad hash function can make lookups in hash tables very slow.

Option 2: If the hash table entries are all full then the hash table can increase the number of buckets that it has and then redistribute all the elements in the table. The hash function returns an integer and the hash table has to take the result of the hash function and mod it against the size of the table that way it can be sure it will get to bucket. So by increasing the size, it will rehash and run the modulo calculations which if you are lucky might send the objects to different buckets.

Java uses both option 1 and 2 in its hash table implementations.

More Related Contents:

  1. What are the differences between a HashMap and a Hashtable in Java?
  2. Good Hash Function for Strings
  3. What happens when a duplicate key is put into a HashMap?
  4. How does Java order items in a HashMap or a HashTable?
  5. Java ball object doesn’t bounce off of drawn rectangles like it’s supposed to.
  6. Collision Detection between two images in Java
  7. Why does LinkedHashSet extend HashSet and implement Set
  8. ConcurrentHashMap and Hashtable in Java [duplicate]
  9. Why does HashMap require that the initial capacity be a power of two?
  10. Java rectangle collision detection confusion
  11. Hashtable key within integer interval
  12. What hashing function does Java use to implement Hashtable class?
  13. Bounding ellipse
  14. Pixel-Perfect Collision Detection Android
  15. Why Hashtable does not allow null keys or values?
  16. Iterating over and deleting from Hashtable in Java
  17. How to keep the order of elements in hashtable
  18. Java/Android – Best way to update apps that are not in the Play Store
  19. Java regular expression “( *|)”: what does the pipe do? [duplicate]
  20. How do you compare two version Strings in Java?
  21. Java Web Start support in Java 9 and beyond
  22. How to obtain the last path segment of a URI
  23. Why does Collections.sort use Mergesort but Arrays.sort does not?
  24. Why is System.arraycopy native in Java?
  25. Why does String.hashCode() in Java have many conflicts? [closed]
  26. How do I simply parse a date without a year specified?
  27. Partial search in HashMap
  28. Spring Boot access static resources missing scr/main/resources
  29. Non socket based Java Server [closed]
  30. How to use reflection to call a private method from outside a java class without getting IllegalAccessException?

Leave a Comment