A finite map data structure that addresses stored values using a function that maps many values to few addresses.

A hash table is a finite map (i.e. a dictionary), mapping keys to associated values, which relies on a hash function to map keys to a small integer that is typically used as an index in an array.

Hash tables are more efficient than other finite map data structures for many kinds of data.

Further reading

history | excerpt history