circularqueuearray.c

#include <stdio.h>
#define N 5

int queue[N];
int front = -1, rear = -1;

void enqueue(int x) {
    if ((rear + 1) % N == front) { 
        printf("Queue is Full\n"); 
    } else if (front == -1) { 
        front = rear = 0; 
        queue[rear] = x; 
    } else { 
        rear = (rear + 1) % N; 
        queue[rear] = x; 
    }
}

void dequeue() {
    if (front == -1) { 
        printf("Queue is Empty\n"); 
    } else if (front == rear) { 
        printf("Deleted: %d\n", queue[front]); 
        front = rear = -1; 
    } else { 
        printf("Deleted: %d\n", queue[front]); 
        front = (front + 1) % N; 
    }
}

void display() {
    if (front == -1) { 
        printf("Queue is Empty\n"); 
        return; 
    }
    int i = front;
    printf("Queue: ");
    while (i != rear) { 
        printf("%d ", queue[i]); 
        i = (i + 1) % N; 
    }
    printf("%d\n", queue[rear]);
}

int main() {
    enqueue(10); enqueue(20); enqueue(30); enqueue(40);
    display(); 
    dequeue(); dequeue(); 
    enqueue(50); enqueue(60); // Testing circular wrap-around
    display();
    return 0;
}