CONTROL (hash table and work with it)

Verification work on the subject of structures and data processing algorithms.

-------------------------------------------------- --------------------

Search using hash functions. Implement an internal hashing method.

Source keys - integers. The size of the hash table must be set with the help of

constant m. Converting a numeric code of the key in the index to perform

using the simplest hash function which takes the remainder of the integer

dividing the code size of the hash table (m). In the event of conflict

when trying to accommodate a new key table, it is searched for first

space according to the formula:

j = ((h (key) + i) mod m) +1, where i = 0,1,2, ... m-2

The program should perform the following steps:

• Add a new key in a table counting made in this comparison;

-Search given key in the table with counting made in this comparison;

deduces the current state of the table on the screen.

-------------------------------------------------- --------------------

The program is implemented in the Delphi programming environment with a window

interface. Ready-control work in the archive control,

there are sources (Delphi 7) with detailed comments.

Evaluation of the teacher posed: Excellent.

-------------------------------------------------- --------------------

PS Use this job as teaching material, an example of which you

You are able to develop and deliver its program of work the teacher perfectly.