queue_array.c

queues Implementation

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