queue basic code.cpp

#include <stdio.h>
#define MAX 6
int Queue[MAX];
int front = 0;
int rear = -1;
int itemCount = 0, i;

void enqueue(int data)
{
    if(rear == MAX-1)
    {
        printf("\nSorry Queue is FULL");
    }
    else
    {
        rear++;
        Queue[rear] = data;
        itemCount++;
        printf("\nStored Successfully!!\n");
    }
}
int dequeue()
{
    if(front ==rear+1 || rear == -1)
    {
        printf("\nQueue is Empty\n");
    }
    else
    {
        int data = Queue[front];
        front++;
        itemCount--;
        return data;
    }
}

void display()
{
    printf("\n\nThe elements in the Queue are \n\n");
    for(i = front; i <= rear ; i++)
    {
        printf("\t%d ",Queue[i]);
    }
}

int main()
{
    printf("\n*** Enqueue ***\n");
    enqueue(10);
    enqueue(20);
    enqueue(30);
    enqueue(40);
    enqueue(50);
    enqueue(60);
    enqueue(100);
    display();

    printf("\n\nTotal Item in the queue = %d \n\n", itemCount);

    printf("\n\n*** Dequeue ***\n\n");

    int num = dequeue();
    printf("Removed Element: %d\n\n",num);
    printf("\n\nAfter Dequeue!!!\n");
    display();

    printf("\n\nTotal Item in the queue = %d \n\n", itemCount);
}