Function Insert

Q-Queue/QueueUsingArray.cpp:4–13

using namespace std;
int queue[50], n=50, front=0, rear=-1;
void Insert(){
    int item;
    if(rear== n-1)                        //Condition of Queue Overflow
    {cout<<"Queue Overflow"<<endl;}        
else{
    cout<<"Enter the item to insert: "<<endl;
    cin>>item;
    rear++;
    queue[rear]=item;
}}
void Delete(){
if((front==0 && rear==-1) || front==rear+1){          //Condition of Queue underflow
     cout<<"Queue Underflow ";