-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathcqueue.c
83 lines (83 loc) · 1.13 KB
/
cqueue.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
#include<stdio.h>
#include<stdlib.h>
#define MAX 5
int cqueue[MAX];
int front=-1;
int rear=-1;
int main( )
{
int choice,item;
while(1)
{
printf("\n 1.Insert");
printf("\n 2.Delete");
printf("/n 3.Display");
printf("/n 4.Quit");
printf("/\nEnter your choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
printf("Input the element for insertion in queue : ");
scanf("%d",&item);
if((front==-1)&&(rear==-1))
{
front=0;
rear=0;
cqueue[rear]=item;
}
else
{
if(((rear+1)%MAX)==front)
printf("\n Q is full");
9
else
{
rear=(rear+1)%MAX;
cqueue[rear]=item;
}
}
break;
}
case 2:
{
if((front==-1)&&(rear==-1))
printf("\n Q IS EMPTY");
else
{
if(front==rear)
else
{
printf("%d ",cqueue[front]);
front=((front+1)%MAX);
}
}
break;
}
case 3:
{
if((front==-1)&&(rear==-1))
printf("\nQ is empty");
else
{
printf("\n Displaying Q");
int i=front;
while(i!=rear)
{
printf("%d ",cqueue[i]);
i=((i+1)%MAX);
}
printf("%d ",cqueue[rear]);
}
break;
}
case 4:
exit(0);
default:
printf("Wrong choice");
}
10
}
return 0;
}