Syntax error Hashing by Multiplication in Data Structure

Hashing by Multiplication in Data Structure

Here we will discuss about the hashing with multiplication method. For this we use the hash function −

?(?) = ⌊???⌋ ??? ?

Here A is a real-valued constant. The advantage of this method is that the value of m is not so critical. We can take m as power of 2 also. Although any value of A gives the hash function, but some values of A are better than others.

According to Knuth, we can use the golden ratio for A, So A will be

$$A=\frac{\sqrt5-1}{2}=0.61803398$$

Of course, no matter what value is chosen for A. The pigeonhole principle implies that if u ≥ nm, then there will be one hash value i and some S ⊆ U of size n, such that h(x) = i for all x in S.

So we can say that the worst case hashing by multiplication is as bad as hashing by division.

Updated on: 2020-08-10T09:24:06+05:30

1K+ Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements