A small phone book as a hash table. Note that the key space is humongous but the hash table is only 1000 slots, which easily fits in computer memory.
Say keys may be up to 20 characters long and we have 26 characters in the alphabet (a-z). That means about 2620 = 19928148895209409152340197376 possible keys. We can not make a table with 2620 slots. But instead we can make a hash table that has 1000 slots.
Original illustration by David Göthberg, Sweden.
Released by David as public domain.
Licensing
Public domainPublic domainfalsefalse
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
Captions
Add a one-line explanation of what this file represents
A small phone book as a hash table. Note that the key space is humongous but the hash table is only 1000 slots, which easily fits in computer memory. Say keys may be up to 20 characters long and we have 26 characters in the alphabet (a-z). That means abo