About this document

Hash Tables: Functions and Implementations by Miguel Ramirez is a document available to read on EtoBox.

Hash tables use hash functions to map keys to array indices. Common hash table implementations include separate chaining and linear probing. A good hash function scrambles keys uniformly and each index is equally likely. Java hash codes must be equal for equal objects and unequal for unequal objects. Common types like integers return their value as a hash code, while strings use Horner

Author

Miguel Ramirez

Language

EN