forked from IOSD/IOSD-NITK-HacktoberFest-Meetup-2019
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.c
More file actions
93 lines (93 loc) · 1.09 KB
/
queue.c
File metadata and controls
93 lines (93 loc) · 1.09 KB
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
#include<stdio.h>
#include<stdlib.h>
#define max 5
void add();
void delet();
void disply();
int q[max],front =-1,rear=-1,i=0,item;
int main()
{
int choice;
do
{
printf("enter the choice");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
add();
break;
}
case 2:
{
delet();
break;
}
case 3:
{
disply();
break;
}
case 4:
{
exit(0);
break;
}
default:
{
printf("\nenter the correct choice\n");
}
}
}
while(choice!=4);
return 0;
}
void add()
{
if(rear>=max-1)
{
printf("Overflow!\n");
}
else
{
printf("enter the data\n");
scanf("%d",&item);
rear++;
q[rear]=item;
}
if(front==-1)
{
front++;
}
}
void delet()
{
item=q[front];
if(front==-1)
{
printf("underflow\n");
}
else if(front==rear)
front=rear=-1;
else{
front++;
printf("deleted item from queue is %d\n",item);
}
}
void disply()
{
if(rear>=0)
{
printf("the elements in queue are\n");
for(int i=0;i<=rear;i++)
{
printf("%d ",q[i]);
}
printf("press next choice\n");
}
else
{
printf("the queue is empty\n");
}
}