Lab 9 hashing

Objective

1. practice search by hashing techniques

Overview

Enhance lab 8 to add more "search with hashing" options:

1. Hashing with linear probing

2. (bonus) Hashing with quadratic probing

3. (bonus) Hashing with chaining

Note

• Choose your hash function and hash table size that suits your test data such that collision code can be verified.

• As an example, if I'm searching just 6 integers, I may have a table of 11 entries and a hashing function of "fold digits mod 11". By mindfully choosing the test data, I would be able to know if my collision algorithm and search algorithm works.

• You should write the insertion routine to "add" items into the hash table. It will make it easier to create your database.

• Try to do a delete routine too. There are additional considerations to be exercised.

Discussions

• Again, exercise with integer is the bottom line.

• Using other objects is strongly encouraged. It is always a good idea to leverage your previous class code.