Hacker News .hnnew | past | comments | ask | show | jobs | submitlogin
How HashMap works in Java (javarevisited.blogspot.com)
7 points by mono on Feb 4, 2011 | hide | past | favorite | 3 comments


Does anyone know why they chose to go with linear probing over double hashing? I could never really think of why one would be more advantageous than the other.


Linear probing will always let you fill a hash table to a load factor (\alpha) of 1. Double hashing may prohibit this, even if it is more efficient for smaller values of \alpha.


That was utterly unreadable.




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: