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.
|
created |
11 years, 9 months ago |
|
viewed |
31 times |
|
active |
11 years, 8 months ago |
|
editors |
1 |
