Hash Collision
noun
say it: “HASH kuh-LIZH-un” /hæʃ kəˈlɪʒən/
Two different keys landing in the same bucket of a hash table.
What is a hash collision?
A hash collision is two different keys landing in the same bucket, like two coats on one hook. There are more possible keys than buckets, so collisions can't be avoided; a hash table handles them, most often by chaining.
In a sentence
- “"Amy" and "May" add up to the same total, so adding up the letters gives a hash collision every time.”
Level: Journeyman · More Data Structures terms at this level
Updated