-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOpen_Address_Collision.c
executable file
·75 lines (75 loc) · 1.1 KB
/
Open_Address_Collision.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include<stdio.h>
#include<stdlib.h>
#define MAX 10
void main()
{
int a[MAX],num,key,i;
int ans;
int create(int);
void linear_prob(int[],int,int);
void display(int[]);
printf("\nCollision handling by linearprobing");
for(i=0;i<MAX;i++)
a[i]=-1;
do
{
printf("\nEnter the no.\t");
scanf("%d",&num);
key=create(num);
linear_prob(a,key,num);
printf("\n\nDo u wish to Continue?...(1/0)...\t");
scanf("%d",&ans);
}while(ans==1);
display(a);
}
int create(int num)
{
int key;
key=num%10;
return key;
}
void linear_prob(int a[MAX],int key,int num)
{
int flag,count=0,i;
void display(int a[]);
flag=0;
if(a[key]==-1)
a[key]=num;
else
{
i=0;
while(i<MAX)
{
if(a[i]!=-1)
count++;
i++;
}
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 && flag==0;i++)
if(a[i]==-1)
{
a[i]=num;
flag=1;
break;
}
}
}
void display(int a[MAX])
{
int i;
printf("\n The Hash table is .....\n");
for(i=0;i<MAX;i++)
printf("\n %d......%d",i,a[i]);
}