‹ ›
XmonoCodes • Learn / Build / Grow

CREATIVITY
MEETS CODE.

Practical knowledge for students, developers and curious builders — from programming and web development to projects, notes and real-world problem solving.

  • “Learn something useful every day.”
  • “Build ideas into real projects.”
  • “Understand the why, not just the how.”
  • “Keep experimenting. Keep improving.”

Latest from XmonoCodes

Explore tutorials, notes, projects, syllabus material and practical coding content.

Monday, February 24, 2025

Enqueue and dequeue in queue

 #include <stdio.h>

#include <stdlib.h>


#define MAX 100


int queue[MAX];

int front = -1, rear = -1;


void enqueue(int value) {

    if (rear == MAX - 1) {

        printf("Queue Overflow\n");

        return;

    }

    if (front == -1) {

        front = 0;

    }

    queue[++rear] = value;

}


int dequeue() {

    if (front == -1 || front > rear) {

        printf("Queue Underflow\n");

        return -1;

    }

    return queue[front++];

}


int main() {

    enqueue(10);

    enqueue(20);

    enqueue(30);


    printf("%d dequeued from queue\n", dequeue());

    printf("%d dequeued from queue\n", dequeue());

    printf("%d dequeued from queue\n", dequeue());


    return 0;

}

No comments:

Post a Comment