circular_queue.c
queues Implementation
87 lines1614 bytesC
1// Circular Queue
2#include <stdio.h>
3#define MAX 5
4
5struct CircularQueue {
6 int front, rear;
7 int arr[MAX];
8};
9
10void initQueue(struct CircularQueue* q) {
11 q->front = -1;
12 q->rear = -1;
13}
14
15int isFull(struct CircularQueue* q) {
16 return (q->rear + 1) % MAX == q->front;
17}
18
19int isEmpty(struct CircularQueue* q) {
20 return q->front == -1;
21}
22
23void enqueue(struct CircularQueue* q, int data) {
24 if (isFull(q)) {
25 printf("Queue is full!\n");
26 return;
27 }
28 if (q->front == -1) {
29 q->front = 0;
30 }
31 q->rear = (q->rear + 1) % MAX;
32 q->arr[q->rear] = data;
33 printf("Enqueued %d\n", data);
34}
35
36int dequeue(struct CircularQueue* q) {
37 if (isEmpty(q)) {
38 printf("Queue is empty!\n");
39 return -1;
40 }
41 int data = q->arr[q->front];
42 if (q->front == q->rear) {
43 q->front = -1;
44 q->rear = -1;
45 } else {
46 q->front = (q->front + 1) % MAX;
47 }
48 return data;
49}
50
51void display(struct CircularQueue* q) {
52 if (isEmpty(q)) {
53 printf("Queue is empty!\n");
54 return;
55 }
56 printf("Circular Queue: ");
57 int i = q->front;
58 while (1) {
59 printf("%d ", q->arr[i]);
60 if (i == q->rear) break;
61 i = (i + 1) % MAX;
62 }
63 printf("\n");
64}
65
66int main() {
67 struct CircularQueue q;
68 initQueue(&q);
69
70 enqueue(&q, 10);
71 enqueue(&q, 20);
72 enqueue(&q, 30);
73 enqueue(&q, 40);
74
75 display(&q);
76
77 printf("Dequeued: %d\n", dequeue(&q));
78 printf("Dequeued: %d\n", dequeue(&q));
79
80 enqueue(&q, 50);
81 enqueue(&q, 60);
82
83 display(&q);
84
85 return 0;
86}
87