This is a C program to Implement Hash Tables with Quadratic Probing.

A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots. Quadratic Probing is similar to Linear Probing. The difference is that if we to try to insert into a space that is filled we would first check 1^1=1 element away then 2^2=4 elements away, then 3^2=9 elements away then 4^2=16 elements away and so on.

1. Create an array of structure (i.e a hash table).

2. Take a key and a value to be stored in hash table as input.

3. Corresponding to the key, an index will be generated i.e every key is stored in a particular array index.

4. Using the generated index, access the data located in that array index.

5. In case of absence of data, create one and insert the data item (key and value) into it and increment the size of hash table.

6. In case the data exists, probe through the subsequent elements (looping back if necessary) for free space to insert new data item.

Note: This probing will continue until we reach the same element again (from where we began probing)

Note: Here, unlike Linear Probing, probing will be done according to the following formula –

(currentPosition + h) % arraySize => Linear Probing

(currentPosition + (h * h)) % arraySize => Quadratic Probing

where h = 1, 2, 3, 4 and so on.

7. To display all the elements of hash table, element at each index is accessed (via for loop).

8. To remove a key from hash table, we will first calculate its index and delete it if key matches, else probe through elements until we find key or an empty space where not a single data has been entered (means data does not exist in the hash table).

9. Exit

Here is the source code of the C Program to implement a Hash Table with Quadratic Probing. The program is successfully compiled and tested using Turbo C compiler in windows environment. The program output is also shown below.

`#include<stdio.h>`

`#include<stdlib.h>`

`/* to store a data (consisting of key and value) in hash table array */`

`struct item`

`{`

int key;

int value;

};

`/* each hash table item has a flag (status) and data (consisting of key and value) */`

`struct hashtable_item`

`{`

int flag;

`/*`

`* flag = 0 : data does not exist`

`* flag = 1 : data exists at given array location`

`* flag = 2 : data was present at least once`

`*/`

struct item *data;

};

struct hashtable_item *array;

int size = 0;

int max = 10;

`/* this function returns corresponding index of the given key */`

int hashcode(int key)

`{`

return (key % max);

`}`

`/* this function initializes the hash table array */`

void init_array()

`{`

int i;

for (i = 0; i < max; i++)

`{`

array[i].flag = 0;

array[i].data = NULL;

`}`

`}`

`/* this function inserts an element in the hash table */`

void insert(int key, int value)

`{`

int index = hashcode(key);

int i = index;

int h = 1;

struct item *new_item = (struct item*) malloc(sizeof(struct item));

new_item->key = key;

new_item->value = value;

`/* probing through the array until an empty space is found */`

while (array[i].flag == 1)

`{`

if (array[i].data->key == key)

`{`

`/* case when already present key matches the given key */`

printf("\n This key is already present in hash table, hence updating it's value \n");

array[i].data->value = value;

return;

`}`

i = (i + (h * h)) % max;

`h++;`

if (i == index)

`{`

printf("\n Hash table is full, cannot add more elements \n");

return;

`}`

`}`

array[i].flag = 1;

array[i].data = new_item;

printf("\n Key (%d) has been inserted\n", key);

`size++;`

`}`

`/* to remove an element form the hash table array */`

void remove_element(int key)

`{`

int index = hashcode(key);

int i = index;

int h = 1;

`/* probing through the hash table until we reach at location where there had not been an element even once */`

while (array[i].flag != 0)

`{`

if (array[i].flag == 1 && array[i].data->key == key)

`{`

`/* case where data exists at the location and its key matches to the given key */`

array[i].flag = 2;

array[i].data = NULL;

`size--;`

printf("\n Key (%d) has been removed \n", key);

return;

`}`

i = (i + (h * h)) % max;

`h++;`

if (i == index)

`{`

break;

`}`

`}`

printf("\n Key does not exist \n");

`}`

`/* to display the contents of hash table */`

void display()

`{`

int i;

for(i = 0; i < max; i++)

`{`

if (array[i].flag != 1)

`{`

printf("\n Array[%d] has no elements \n", i);

`}`

`else`

`{`

printf("\n Array[%d] has elements \n %d (key) and %d (value) \n", i, array[i].data->key, array[i].data->value);

`}`

`}`

`}`

int size_of_hashtable()

`{`

return size;

`}`

void main()

`{`

int choice, key, value, n, c;

clrscr();

array = (struct hashtable_item*) malloc(max * sizeof(struct hashtable_item*));

init_array();

do {

printf("Implementation of Hash Table in C with Quadratic Probing.\n\n");

printf("MENU-: \n1.Inserting item in the Hash table"

`"\n2.Removing item from the Hash table"`

`"\n3.Check the size of Hash table"`

`"\n4.Display Hash table"`

"\n\n Please enter your choice-:");

scanf("%d", &choice);

switch(choice)

`{`

case 1:

printf("Inserting element in Hash table \n");

printf("Enter key and value-:\t");

scanf("%d %d", &key, &value);

insert(key, value);

break;

case 2:

printf("Deleting in Hash table \n Enter the key to delete-:");

scanf("%d", &key);

remove_element(key);

break;

case 3:

n = size_of_hashtable();

printf("Size of Hash table is-:%d\n", n);

break;

case 4:

display();

break;

default:

printf("Wrong Input\n");

`}`

printf("\n Do you want to continue-:(press 1 for yes)\t");

scanf("%d", &c);

}while(c == 1);

getch();

`}`

Note : Hash table with Linear Probing runs the same way as Hash table with Quadratic Probing except that in case of data collision, next position in Quadratic Probing is calculated as -:

(currentPosition + (h * h)) % arraySize, where h = 1, 2, 3, 4……

whereas in Linear Probing the formula used is -:

(currentPosition + h) % arraySize, where h = 1, 2, 3, 4……..

1. Create a structure, item having a key and value representing data to be inserted in hash table.

2. Create another structure, hash table_item with variable data (key and value) and flag as a status variable which informs about the status of array index.

flag = 1 : presence of some data at the array index.

flag = 0 : data not present in array index even once

flag = 2 : data had been removed from array index at least once

3. Now create an array of structure (hashtable_item) of some certain size(10, in this case). This array will be our hash table.

4. A menu is displayed on the screen.

5. User must choose one option from four choices given in the menu.

6. 1st choice: Inserting item into hash table

(a) Take a key and a value as input.

(b) Calculate index as per the given key (using hashcode() function).

(c) Access the element at this calculated index in array.

(d) If there is no element at that particular array index, add straight way.

(e) If an element is present, check whether the given key matches the element’s key. If yes, then update it’s value and return. Otherwise probe through subsequent elements (looping back if necessary), to find free space. While probing

* if given key matches the element’s key, update its value and return.

* if a free space is found, add the data at that position.

Probing will stop until we reach the same element from where we began probing. Until then, if no free space is found, then add will fail.

7. 2nd choice: Removing a key from hash table

(a) Take a key as input which needs to be removed.

(b) Calculate index as per the given key (using hashcode() function).

(c) Access the element at the calculated array index.

(d) If an element is present, check whether the given key matches the element’s key. If yes, then delete the key and return decrementing the size. Otherwise probe through subsequent elements (looping back if necessary), to find free space with flag = 0. While probing

* if given key matches the element’s key, delete and return.

* if a free space is found (with flag = 2), continue to probe.

(e) If no free space (flag = 0) is found even after probing through all element it means, key does not exist in the hash table.

8. 3rd choice: Size of hash table

(a) Each time we add a new data item into the hash table, we increment it’s size by 1.

(b) Each time we remove a data item from the hash table, we decrement it’s size by 1.

(c) The size of the hash table can be determined either by size variable or size_of_hashtable() method.

9. 4th choice: Display hash table

(a) Function display() runs for displaying hash table contents.

(b) Here a for loop runs from 0 to array_size-1 with i as iterator.

(c) The code inside loop consists of taking i as index and accessing each element at that index of array.

Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 3 Size of hash table is-: 0 Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 1 Inserting element in Hash table Enter key and value-: 12 10 Key (12) has been inserted Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 1 Inserting element in hash table Enter key and value-: 122 4 Key (122) has been inserted Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 1 Inserting element in hash table Enter key and value-: 82 5 Key (82) has been inserted Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 3 Size of hash table is-: 3 Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 4 Array[0] has no elements Array[1] has no elements Array[2] has elements-: 12 (key) and 10 (value) Array[3] has elements-: 122(key) and 4(value) Array[4] has no elements Array[5] has no elements Array[6] has no elements Array[7] has no elements 82(key) and 5(value) Array[8] has no elements Array[9] has no elements Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 2 Deleting in hash table Enter the key to delete-: 122 Key (122) has been removed Do you want to continue-:(press 1 for yes) 1 Implementation of Hash Table in C with Quadratic Probing MENU-: 1. Inserting item in the Hash table 2. Removing item from the Hash table 3. Check the size of Hash table 4. Display Hash table Please enter your choice-: 2 Deleting in hash table Enter the key to delete-: 56 This key does not exist Do you want to continue-:(press 1 for yes) 2

**Sanfoundry Global Education & Learning Series – 1000 C Programs.**

Here’s the list of Best Books in C Programming, Data Structures and Algorithms.

**Next Steps:**

- Get Free Certificate of Merit in Data Structure I
- Participate in Data Structure I Certification Contest
- Become a Top Ranker in Data Structure I
- Take Data Structure I Tests
- Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
- Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

**Related Posts:**

- Apply for Computer Science Internship
- Apply for Data Structure Internship
- Buy Programming Books
- Practice Design & Analysis of Algorithms MCQ
- Apply for Information Technology Internship