The distribution of
this hashing function is dependent on the distribution of the key
values. the key values are analyzed to determine which digit positions
of the key are more evenly distributed. the more evenly distributed
digit positions are assigned from right to left. the digit values in the
chosen digit positions are extracted, and the resulting integer is used
as the relative address. if none of the digit positions has a uniform
distribution, more collisions occur.
example:
enter number:265791353
enter number of digit places:1-3-5-7/*this is the position of the number
in the number:25936 which is : 2 5 9 3 in which:1st(2) 3rd(5) 5th(9) 7th
(3)*/
the other numbers in the number:265791353 will be added in the first
number:2593 which is:6715 (2nd(6) 4th(7) 6th(1) 8th(5))//
2593+6715;
answer is:
9308
then get the last two digits as the final answer:
08
Last edited on