Hash tables
•Assume we have a Table of structures with locations 0 thru 100.
•Say we are searching for employee id numbers (positive integers).
•We start with a hash function that takes the id number as input and maps it to an integer ranging from 0 to 100.
•So, the ADT operations performs the following:
–TableIndex=hashfunction(employee id #)