-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueue.c
99 lines (90 loc) · 2.19 KB
/
Queue.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>
#define MAX 5
void Enqueue(int);
void Dequeue();
void QueueFront();
void QueueRear();
void Display();
int front = -1, rear = -1, queue[MAX];
int main() {
int choice, data;
do {
printf("\nEnter choice\n1. Enqueue\n2. Dequeue\n3. Front of Queue\n4. Rear of Queue\n5. Display\n6. Exit\t");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("\nEnter data: ");
scanf("%d", &data);
Enqueue(data);
Display();
break;
case 2:
Dequeue();
Display();
break;
case 3:
QueueFront();
break;
case 4:
QueueRear();
break;
case 5:
Display();
break;
case 6:
exit(0);
break;
default:
printf("\nEnter a valid choice!");
}
} while (choice != 6);
return 0;
}
void Enqueue(int info) {
if(rear == (MAX - 1))
printf("\nQueue is Full!");
else if(front == -1) {
front = rear = 0;
queue[rear] = info;
}
else
queue[++rear] = info;
}
void Dequeue() {
if (front == -1)
printf("\nQueue is Empty!");
else {
printf("\nElement Dequeued: %d", queue[front]);
if (front == rear)
front = rear = -1;
else
front++;
}
}
void QueueFront() {
if (front == -1)
printf("\nQueue is Empty!");
else
printf("\nFront of queue: %d", queue[front]);
}
void QueueRear() {
if (rear == -1)
printf("\nQueue is Empty!");
else
printf("\nRear of queue: %d", queue[rear]);
}
void Display() {
int i;
if(front == -1)
printf("\nQueue is Empty!");
else {
printf("\nFRONT: ");
for(i = front ; i <= rear ; i++) {
printf("%d", queue[i]);
if(i < rear)
printf(" <-- ");
}
printf(" :REAR\n");
}
}