Hash tables
•Another way to avoid collisions is to create a hash table which is large enough so that each
•For example, for employee id numbers (###-##-###) ... we'd need to have enough locations to hold numbers from 000-00-000 to 999-99-999.
•Obviously this would require a TREMENDOUS amount of memory!
•And, if we only have 100 employees -- our hash table FAR EXCEEDS the number of items we really need to store. RESERVING SUCH VAST amounts of memory is not practical.