CONTROL (Hash table and work with it)

Examination on the subject Structures and data processing algorithms.
----------------------------------------------------------------------
Search using hash functions. Implement an internal hashing method.
The original keys are integers. The hash table size must be specified using
constants m. Convert numeric key code to index value execute
using a simple hash function that takes the remainder of an integer
dividing the code by the size of the hash table (m). In the event of a conflict
when trying to place a new key in the table, the first one is searched for
free space according to the formula:
j = ((h (key) + i) mod m) +1, where i = 0,1,2, ... m-2
The program should do the following:
-adding a new key to the table with the calculation of the comparisons made;
-search for a given key in the table with the calculation of the comparisons made;
- displaying the current state of the table on the screen.
----------------------------------------------------------------------
The program is implemented in the Delphi programming environment with window
interface. Finished test, in the archive of the test,
there are sources (Delphi 7) with detailed comments.
Assessment given by the teacher: EXCELLENT.
----------------------------------------------------------------------
PS Use this work as educational material, by the example of which, you
you will be able to develop your own program and hand over the work to the teacher perfectly.