
558 Programming and Data Structures
calculated and their mid digits are evaluated. Based on the mid digits the keys are paced in the
appropriate index. Here the mid digit obtained can be from 0 to 9. Hence, we may need up to ten
indices starting from index 0 through index 9.
For example, if the key is k=10,
H(10)=(10*10)=100.
Its middle digit is 0. Hence, number 10 would be placed in index 0. Similarly, the same procedure is
adopted for all other numbers and they are placed in different indices based on the mid digit value.
Consider the following numbers for constricting the hashing table.
12,14,18,20,36,31,27,35,23,59.
Table 15.2 Table of