The basic idea in hashing is to take a field in a record, known as the key, and convert it through some fixed process to a numeric value (Hash Value) hash functions are mostly used to speed up table lookup or data comparison tasks. A good has function satisfies the assumption of simple uniform hashing: each key is equally likely to hash to any of the m slots, independently of where any other key has hashed to.
Original Description:
Original Title
Alqrainy's Function to minimize the collision of hashing
The basic idea in hashing is to take a field in a record, known as the key, and convert it through some fixed process to a numeric value (Hash Value) hash functions are mostly used to speed …