-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue Using Array.c
113 lines (84 loc) · 1.26 KB
/
Queue Using Array.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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<stdio.h>
#define SIZE 5
int inqueue();
int dequeue();
int display();
int front = -1;
int rear = -1;
int queue[SIZE];
int choice;
int main(){
while(choice != 4)
{
printf("Select Your Choice:\n");
printf("1.Insert The Value in Queue.\n");
printf("2.Delete The Value from Queue.\n");
printf("3.Display The Value in Queue.\n");
printf("4.Exit.\n");
scanf("%d",&choice);
switch(choice)
{
case 1:
inqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
break;
}
}
}
int inqueue() {
if(rear==SIZE-1)
{
printf("Queue Is Full....!!!\n");
}
else
{
rear=rear+1;
printf("Enter the Value to insert in queue:\n");
scanf("%d",&queue[rear]);
if(front==-1)
{
front = 0;
}
}
}
int dequeue(){
if(front == -1)
{
printf("Queue Is Empty..!!\n");
}
else
{
printf(" Deleted : %d\n",queue[front]);
if(front == rear)
{
front = -1;
rear = -1;
}
else
{
queue[front]=0;
front=front+1;
}
}
display();
}
int display(){
if(front == -1)
{
printf("Queue Is Empty..!!\n");
}
else
{
for(int i=front;i<=rear ;i++)
{
printf("Values in Queue is :%d\n",queue[i]);
}
}
}