simple program using queue in data structure

#include<iostream>

using namespace std;

class Queue

{

private:

int front;

int rear;

int arr[5];

public:

Queue()

{

front=-1;

rear=-1;

for(int i=0;i<5;i++)

{

arr[i]=0;

}

}

void Enqueue()

{

int en;

if(rear==4)

{

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

}

else

{

if(rear==-1 && front==-1)

{

front=0;

}

    cout<<"-------------------------"<<endl;

    cout<<"Enter element in Queue:";

cin>>en;

cout<<"-------------------------"<<endl;

rear++;

arr[rear]=en;

}

}

void Dequeue()

{

if(rear==-1 && front==-1)

{

cout<<"Queue is already empty"<<endl;

}

else

{

cout<<"-----------------------------------------"<<endl;

cout<<"element deleted from queue is:"<<arr[front]<<endl;

cout<<"-----------------------------------------"<<endl;

front++;

}

}

void Display()

{

for(int i=front;i<=rear;i++)

{

cout<<"----------------"<<endl;

cout<<arr[i]<<" "<<endl;

cout<<"----------------"<<endl;

}

}

int count()

{

return(rear-front+1);

}

};

int main()

{

Queue obj;

cout<<"\t1.Enquque"<<endl;

cout<<"\t2.Dequeue"<<endl;

cout<<"\t3.Display"<<endl;

cout<<"\t4.count"<<endl;

int c;

while(true)

{

cout<<"please enter your choice:";

cin>>c;

switch(c)

{

case 1:

obj.Enqueue();

break;

case 2:

obj.Dequeue();

break;

case 3:

obj.Display();

break;

case 4:

cout<<obj.count()<<" values are in queue"<<endl;

break;

default:

cout<<"wrong choice:"<<endl;

break;

}

  }

}