Probe Method is not used for hash function.
Hash function is a function which, when applied to the key, produced an integer which can be used as an address in a hash table. The intent is that elements will be relatively, randomly and uniformly distributed.
Perfect Hah function is a function which, when applied to all the members of the set of items to be stored in a hash table, produces a unique set of integers within some suitable range. Such function produces no collisions.
Good hash function minimizes collisions by spreading the elements uniformly throughout the array.
Some common hash functions are
- Folding Method
- Division Method
- Mid-square Method
- Multiplication Method
