From 737c286ff9799a7bd129fc67ac5d2ce488ed3a51 Mon Sep 17 00:00:00 2001
From: Punyashree <86178972+Punyashre@users.noreply.github.com>
Date: Tue, 25 Oct 2022 23:32:23 +0530
Subject: [PATCH] Create collisionhandlingbylinearprobing.c

output:
collision handling by linear probing :

Enter the data5
Do you wish to continue ? (1/0) 1
Enter the data25
Do you wish to continue ? (1/0) 1
Enter the data15
Do you wish to continue ? (1/0) 1
Enter the data10
Do you wish to continue ? (1/0) 1
Enter the data25
Collision Detected...!!!
Collision avoided successfully using LINEAR PROBING

 Do you wish to continue ? (1/0) 0
 1.Display ALL
 2.Filtered Display
2
the hash table is

 5 5
 10 10
 15 15
 25 25
 26 25
---
 .../collisionhandlingbylinearprobing.c        | 105 ++++++++++++++++++
 1 file changed, 105 insertions(+)
 create mode 100644 collision handling by linear probing/collisionhandlingbylinearprobing.c

diff --git a/collision handling by linear probing/collisionhandlingbylinearprobing.c b/collision handling by linear probing/collisionhandlingbylinearprobing.c
new file mode 100644
index 0000000..a222187
--- /dev/null
+++ b/collision handling by linear probing/collisionhandlingbylinearprobing.c	
@@ -0,0 +1,105 @@
+#include <stdio.h>
+#include <stdlib.h> 
+#define MAX 100 
+
+/*FUNCTION PROTOTYPE */
+int create(int);
+void linear_prob(int[], int, int); 
+void display (int[]);
+
+int main()
+{
+	int a[MAX],num,key,i; 
+	int ans=1;
+	printf(" collision handling by linear probing : \n"); 
+	for (i=0;i<MAX;i++)
+	{
+		a[i] = -1;	
+	}
+	do
+	{
+		printf("\n Enter the data");
+		scanf("%4d", &num);
+		key= num%100;
+		linear_prob(a,key,num);
+		printf("\n Do you wish to continue ? (1/0) ");
+		scanf("%d",&ans);
+	}while(ans);
+	display(a);
+}
+
+void linear_prob(int a[MAX], int key, int num)
+{
+	int flag, i, count=0; 
+	flag=0; 
+	if(a[key]== -1)
+	{
+		a[key] = num;
+	}
+	else
+	{
+		printf("\nCollision Detected...!!!\n");
+		i=0;
+		while(i<MAX)
+		{
+			if (a[i]!=-1) 
+				count++;
+			i++;
+
+		}
+		printf("Collision avoided successfully using LINEAR PROBING\n"); 
+		if(count == MAX)
+		{
+			printf("\n Hash table is full"); 
+			display(a);
+			exit(1);
+		}
+		for(i=key+1; i<MAX; i++) 
+			if(a[i] == -1)
+			{
+				a[i] = num;
+				flag =1;
+				break;
+			}
+		//for(i=0;i<key;i++)
+		i=0;
+		while((i<key) && (flag==0))
+		{
+			if(a[i] == -1)
+			{
+				a[i] = num;
+				flag=1;
+				break;
+
+			}
+
+		i++;
+
+		}
+
+	}
+
+}
+
+void display(int a[MAX])
+{
+	int i,choice;
+	printf("1.Display ALL\n 2.Filtered Display\n"); 
+	scanf("%d",&choice);
+	if(choice==1)
+	{
+		printf("\n the hash table is\n"); 
+		for(i=0; i<MAX; i++)
+			printf("\n %d %d ", i, a[i]);
+
+	}
+	else
+	{
+		printf("\n the hash table is\n"); 
+		for(i=0; i<MAX; i++)
+			if(a[i]!=-1)
+			{
+				printf("\n %d %d ", i, a[i]);
+			}
+	}
+}