/
linear probing.c
64 lines (55 loc) · 1.03 KB
/
linear probing.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
#include<stdio.h>
#include<stdlib.h>
#define size 22
int hashTable[size];
void hashinit()
{
for(int i=0;i<size;i++)
hashTable[i]=-1;
}
//displauing of hash table
void display()
{
for(int i=0;i<size;i++)
printf("%d",hashTable[i]);
}
/*
inserting value in linear probing
h[k,i]=(h'[k]+i)mod m
where m is the size of the hash table
h'[k]= key mod m
mod= % operator
*/
void linearInsert(int key)
{
int index=0, m=size;
int hkey=key%m;
index=(hkey)%m;
while(hashTable[index]!=-1 && i<size)
{
index= (hkey+i)%m;
i++;
}
hashTable[index]=key;
}
int search(int keyfind)
{
int index=0,m=size;
int hkey=keyfind%m;
for(int i=0;i<size;i++)
{
index=(hkey+i)%m;
if(hashTable[index]==keyfind)
return index;
else
return -1;
}
}
void deletelinear(int delkey)
{
int index=search(delkey);
if(index==-1)
printf("cannot delete the value in the index\n");
else
hashTable[index]=-1;
}