-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathCircularQueue.c
More file actions
86 lines (73 loc) · 1.57 KB
/
CircularQueue.c
File metadata and controls
86 lines (73 loc) · 1.57 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
#include <stdio.h>
#define SIZE 4
typedef struct {
int container[SIZE];
int front;
int rear;
} queue;
queue getNewQueue() {
queue newQ;
newQ.front = -1;
newQ.rear = -1;
return newQ;
}
int isEmpty(queue* Q) {
if (Q->front == -1) {
return 1;
}
else {
return 0;
}
}
int isFull(queue* Q) {
return (Q->rear + 1) % SIZE == Q->front;
}
void enqueue(queue* Q, int value) {
if (isFull(Q)) {
printf("[This Queue is full] ");
return;
}
else if (Q->front == -1) {
Q->front = 0;
Q->rear = 0;
Q->container[Q->rear] = value;
}
else {
Q->rear = (Q->rear + 1) % SIZE;
Q->container[Q->rear] = value;
}
}
int dequeue(queue* Q) {
if (isEmpty(Q)) {
printf("[This Queue is empty, Return value should be ignored] ");
return -1;
}
// Only one element left
else if (Q->front == Q->rear) {
int temp = Q->container[Q->front];
Q->front = -1;
Q->rear = -1;
return temp;
}
int temp = Q->container[Q->front];
Q->front = (Q->front + 1) % SIZE;
return temp;
}
int main(void) {
queue q1 = getNewQueue();
for (int i = 0; i < 4; i++) {
enqueue(&q1, i);
printf("Enqueue : %d\n", i);
}
for (int i = 0; i < 3; i++) {
printf("Dequeue : %d\n", dequeue(&q1));
}
for (int i = 0; i < 4; i++) {
enqueue(&q1, i);
printf("Enqueue : %d\n", i);
}
for (int i = 0; i < 5; i++) {
printf("Dequeue : %d\n", dequeue(&q1));
}
return 0;
}