Finding a good hash function
Hi there,
I am using a hash table where the 'key' would 32 bit integer values. The hash table has a max entries of 1000.
Example key values: 143806728,143806776, 143806824, 143806872, 143806920
(The keys are actually memory addresses returned by some applications)
How can I chose a hash function to reduce collisions.
Thank you.
I am using a hash table where the 'key' would 32 bit integer values. The hash table has a max entries of 1000.
Example key values: 143806728,143806776, 143806824, 143806872, 143806920
(The keys are actually memory addresses returned by some applications)
How can I chose a hash function to reduce collisions.
Thank you.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER