mirror of
https://github.com/trekhleb/javascript-algorithms.git
synced 2025-12-08 19:06:00 +00:00
95641c8aaf
* Create README.fr-FR.md * Translate to french "Priority Queue" module * Add english lang redirection * Update README.fr-FR.md * Update README.fr-FR.md * Add French lang version redir * Create README.fr-FR.md * Added french translation for Queue * Added French lang redir * Update README.md * Create README.fr-FR.md * Add french translation * Index french translation * Create README.fr-FR.md * Add french translation * Index french translation * Fix translation * Create README.fr-FR.md * Add french translation * Index french translation * Add wikipedia french reference * Add french wikipedia reference
34 lines
1.2 KiB
Markdown
34 lines
1.2 KiB
Markdown
# Hash Table
|
||
|
||
_Read this in other languages:_
|
||
[_简体中文_](README.zh-CN.md),
|
||
[_Русский_](README.ru-RU.md),
|
||
[_日本語_](README.ja-JP.md),
|
||
[_Français_](README.fr-FR.md),
|
||
[_Português_](README.pt-BR.md)
|
||
|
||
In computing, a **hash table** (hash map) is a data
|
||
structure which implements an *associative array*
|
||
abstract data type, a structure that can *map keys
|
||
to values*. A hash table uses a *hash function* to
|
||
compute an index into an array of buckets or slots,
|
||
from which the desired value can be found
|
||
|
||
Ideally, the hash function will assign each key to a
|
||
unique bucket, but most hash table designs employ an
|
||
imperfect hash function, which might cause hash
|
||
collisions where the hash function generates the same
|
||
index for more than one key. Such collisions must be
|
||
accommodated in some way.
|
||
|
||
|
||
|
||
Hash collision resolved by separate chaining.
|
||
|
||
|
||
|
||
## References
|
||
|
||
- [Wikipedia](https://en.wikipedia.org/wiki/Hash_table)
|
||
- [YouTube](https://www.youtube.com/watch?v=shs0KM3wKv8&index=4&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
|