|
To finish things off, I have
hard copies of the next five slides. I tell the students that these are some
records of my past students and I want to store them in a small hash table
with size 5 (indexes 0 to 4). Of course, this is an unrealistic size, but it
makes sure that they know the insertion, searching, and deletion algorithms.
I then use five students from the front row to be the hash table locations. I
insert the five items, remove Bill Clinton and do three searches (for Will
Smith, Bill Clinton, and Elizabeth).
|
