Skip to main content

Hashing with Quadratic Probing

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.

Hashing using mod function

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 quadratic probing to resolve collision.

In Quadratic Probing we find the new Position using the formula

new_Position = old_Position + (i^2)
where i is a natural number

so for the above example we get position 1 for 14 but 1 is already taken hence we calculate new position,

new_Position = 1 + (1^2) = 2

now we check if position is taken or not, if position 2 is empty then we store 14 at second position, else we calculate new position by taking i as 2

new_Position = 1 + (2^2) = 5

We keep repeating this till we find a new position

To know more about hash functions and how to select hash function click Here.
To know more about quadratic probing click Here

C++ Program

Sample input and output to check the program

You might also be interested in

Hashing with Linear Probing
Double Hashing
Find Trailing number of zeros in factorial of a number.
Check if a number is a Fibonacci number or not
Insertion Sort
Bubble sort Algorithm


  1. I feel satisfied to read your blog, you have been delivering a useful & unique information to our vision.keep blogging.
    ccna Training in Chennai
    ccna course in Chennai
    PHP Training in Chennai
    ReactJS Training in Chennai
    ccna course in chennai
    ccna training in chennai

  2. This comment has been removed by a blog administrator.


Post a Comment

Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack.

Infix expressions are the expressions that we normally use,eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+567 , +a*bc etc.

This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.

NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code.

So, to convert an infix expression to a prefix expression we follow the below steps
(we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)

We first revers…

Home Page