Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index.

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.

now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.

Inorder to resolve collision we employ various collision resolving methods here we use double hashing to resolve collision.

In Double Hashing instead of 1 hash function we have 2 hash functions, and we can use combination of these 2 functions to generate new position and check if the new position found is empty or not .we find the new Position using the formula given below.

new_Position = (i*h1(element) + h2(element)) % SIZE;

where i is a natural number

SIZE is the size of the hash table.

To know more about hash functions and how to select hash function click

To know more about Double Hashing click

You might also be interested in

Hashing with Linear Probing

Hashing with Quadratic Probing

Find Trailing number of zeros in factorial of a number.

Check if a number is a Fibonacci number or not

Find Factorial of a number

Bubble sort Algorithm

Insertion sort Algorithm

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.

now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.

Inorder to resolve collision we employ various collision resolving methods here we use double hashing to resolve collision.

In Double Hashing instead of 1 hash function we have 2 hash functions, and we can use combination of these 2 functions to generate new position and check if the new position found is empty or not .we find the new Position using the formula given below.

new_Position = (i*h1(element) + h2(element)) % SIZE;

where i is a natural number

SIZE is the size of the hash table.

To know more about hash functions and how to select hash function click

**Here**.To know more about Double Hashing click

**Here**### C++ Program

### Sample input and output to check the program

You might also be interested in

Hashing with Linear Probing

Hashing with Quadratic Probing

Find Trailing number of zeros in factorial of a number.

Check if a number is a Fibonacci number or not

Find Factorial of a number

Bubble sort Algorithm

Insertion sort Algorithm

## Comments

## Post a Comment