Reverse a Queue using Stack in C++.

#include <iostream>

#define MAX 5

using namespace std;

int array[MAX];

int front=-1,rear=-1,count=0;

int stc1[MAX],stc2[MAX], stc1_top=0,stc2_top=0;

void enqueue(int data) ///enqueue element from this function

{

    if(MAX==count) ///if the array is full

    {

        cout<<"Your Queue is Full"<<endl;

    }

    else

    {

        if(front==-1) ///for the 1st input

        {

            front++;

            rear++;

        }

        else

        {

            rear = (rear+1)%MAX; /// increment rear by add 1 and then Mood the rear with Max

        }

        array[rear]=data; ///save data

        count++;///increment count

    }

}

int pop()

{

    int num;

    if(stc1_top==0)

    {

        cout<<"No Data Found";

        return 0;

    }

    else

    {

        stc1_top=stc1_top-1; ///delete last element

    }

    return num;

}

void dequeue()

{

    while(count>0) ///save to a stack

    {

     stc1[stc1_top]=array[front];

     front = (front+1)%MAX;

     stc1_top++;

     count--;

    }

    stc1_top--;

    front=-1;

    rear=-1;

    count=0;

    while(stc1_top>=0) ///pop the value from the stack and send it to the queue

    {

        enqueue(stc1[stc1_top]);

        stc1_top--;

    }

}

void display()

{

    int c,i;

    if(count==0)///if the array is empty

    {

        cout<<"The Queue is Empty"<<endl<<endl;

        return;

    }

    cout<<"Your Queue: ";

    for(i=front,c=1; c<=count; i = (i+1)%MAX,c++) ///compare c with count and increase the i value and mood it by MAX

    {

        cout<<array[i]<<" ";

    }

    cout<<endl;

}

void menu()

{

    int n;

    while(1)

    {

        cout<<"Press 1 For EnqueuePress 2 For ReversePress 3 For Display QueuePress 0 For Exit";

        cin>>n;

        if(n==1)

        {

            int data;

        cout<<"Data: ";

        cin>>data;

            enqueue(data);

        }

        else if(n==2)

        {

            dequeue();

        }

        else if(n==3)

        {

          display();

        }

        else if(n==0)

        {

            return;

        }

    }

}

int main()

{

    menu();

    return 0;

}