-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueue (1).c
104 lines (96 loc) · 1.46 KB
/
queue (1).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
#include <stdio.h>
#define size 5
void enqueue(int);
void display(void);
void dequeue(void);
int a[size];
int front,rear;
void main()
{
int c,data;
front = -1;
rear = -1;
do
{
printf("\t\t\t\tMAIN MENU \n");
printf("1.Enqueue data \n");
printf("2.Dequeue data \n");
printf("3.Display queue \n");
printf("4.Exit \n");
printf("Enter your choice \n");
scanf("%d",&c);
switch(c)
{
case 1: printf("Enter the data value to be enqueued in the queue \n");
scanf("%d",&data);
enqueue(data);
display();
break;
case 2: printf("Dequeueing data..... \n");
dequeue();
display();
break;
case 3: printf("displaying queue..... \n");
display();
break;
case 4: return;
default:return;
}
}
while(c != 4);
}
void enqueue(int data)
{
if(rear == -1 && front == -1)
{
front = 0;
rear = 0;
a[rear] = data;
}
else if(front == (rear + 1) % size)
{
printf("Error Overflow : queue is full ! \n");
return;
}
else
{
rear = (rear + 1) % size;
a[rear] = data;
}
}
void display()
{
if(rear == -1 && front == -1)
{
printf("Empty Queue ! \n");
return;
}
int i;
i = front;
while(1)
{
if(i == rear)
{
printf("%d",a[i]);
return;
}
printf("%d",a[i]);
i = (i + 1) % size;
}
}
void dequeue()
{
if(rear == -1 && front == -1)
{
printf("Error Underflow : Can not enqueue more \n");
return;
}
else if(front == rear)
{
front = -1;
rear = -1;
return;
}
else
front = (front + 1) % size;
}