-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchaining.c
99 lines (97 loc) · 2.05 KB
/
chaining.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include <stdio.h>
#include "stdlib.h"
struct node
{
int data;
struct node *next;
};
struct node *head[10]={NULL},*c;
int insert()
{
int i,key;
printf("\nEnter a value to insert it into hash table\n");
scanf("%d",&key);
i=key%10;
struct node * newnode=(struct node *)malloc(sizeof(struct node));
newnode->data=key;
newnode->next = NULL;
if(head[i] == NULL)
head[i] = newnode;
else
{
c=head[i];
while(c->next != NULL)
{
c=c->next;
}
c->next=newnode;
}
return 0;
}
int search()
{
int key,index;
printf("\nEnter the element to be searched\n");
scanf("%d",&key);
index=key%10;
if(head[index] == NULL)
printf("\n Search element not found\n");
else
{
for(c=head[index];c!=NULL;c=c->next)
{
if(c->data == key)
{
printf("search element found\n");
break;
}
}
if(c==NULL)
printf("\n Search element not found\n");
}
return 0;
}
int display()
{
int i;
for(i=0;i<10;i++)
{
printf("\nEntries at index %d\n",i);
if(head[i] == NULL)
{
printf("No Hash Entry");
}
else
{
for(c=head[i];c!=NULL;c=c->next)
printf("%d->",c->data);
}
}
return 0;
}
int main()
{
int ch,key,i;
printf("\n###______Hash Table using Chaining______###\n");
while(1)
{
printf("\n1. Insert\n2. Display \n3. Search \n4.Exit \n");
scanf("%d",&ch);
switch(ch)
{
case 1:
insert();
break;
case 2:
display();
break;
case 3:
search();
break;
case 4:exit(0);
default:
printf("Invalid Choice...!");
}
}
return 0;
}