Tutorial 5: Providing the right element functions,
exchanging the implementation variants

You want to exchange the implementation variant of the last example
from an AVL tree to a hash table.

1) Modify the file kperson.h to provide a hash function for the person record.
2) Change the include file and the typedef statement to use
   a set set based on a hash table.
3) Run the program.
NOTE: Nothing else has to be changed, default size of 100 is provided
      for the hash table.
4) Provide an estimated size for the hashtable.
5) Run the program again.

Have a look at the results with your debugger.