Circular Queue Implementation in C Using Array

Introduction

In this tutorial, we will learn about Circular Queue Implementation in C Using Array. This is a crucial concept widely used in software development.

Implementation Example

Here is the complete source code to demonstrate how this works in practice:

#include <stdio.h>
#define SIZE 5

int items[SIZE];
int front = -1, rear = -1;

int isFull() {
    if ((front == rear + 1) || (front == 0 && rear == SIZE - 1)) return 1;
    return 0;
}

int isEmpty() {
    if (front == -1) return 1;
    return 0;
}

void enQueue(int element) {
    if (isFull()) printf("Queue is full
");
    else {
        if (front == -1) front = 0;
        rear = (rear + 1) % SIZE;
        items[rear] = element;
        printf("Inserted -> %d
", element);
    }
}

int main() {
    enQueue(1);
    enQueue(2);
    enQueue(3);
    enQueue(4);
    enQueue(5);
    enQueue(6); // Fails
    return 0;
}

Code Explanation

The code above illustrates the core logic required to implement Circular Queue Implementation in C Using Array. By breaking it down, we can observe the following:

• Initialization: Proper setup of the variables and structures.
• Processing: Applying the core algorithm to achieve the result.
• Output: Printing the final results clearly.

Conclusion

Understanding Circular Queue Implementation in C Using Array is critical for mastering the fundamentals of programming. Keep practicing to solidify these concepts!