circular queue

#include<bits/stdc++.h>
using namespace std;
int arraysize=4;
void enqueue(int q[],int &rear,int item,int &cnt)
{
    if(cnt==arraysize)
        cout<<"OVERFLOW"<<endl;
    else
    {
        q[rear]=item;
        rear=(rear+1)%arraysize;
        cnt++;
    }
}
void dequeue(int q[],int &frnt,int &cnt)
{
    if(cnt==0)
        cout<<"UNDERFLOW"<<endl;
    else
    {
        q[frnt]=0;
        frnt=(frnt+1)%arraysize;
        cnt--;
    }
}
int getfrnt(int q[],int frnt)
{
    return q[frnt];
}
void display(int q[],int frnt,int rear)
{
   for(int i=frnt;i!=rear;i=(i+1)%arraysize)
       cout<<getfrnt(q,i)<<" ";
   cout<<"\n";
}
int main()
{
    int ar[arraysize+1],rear=0,frnt=0,cnt=0;
    enqueue(ar,rear,5,cnt); display(ar,frnt,rear);
    enqueue(ar,rear,10,cnt);display(ar,frnt,rear);
    enqueue(ar,rear,10,cnt);display(ar,frnt,rear);
    dequeue(ar,frnt,cnt); display(ar,frnt,rear);
    enqueue(ar,rear,20,cnt);display(ar,frnt,rear);
    dequeue(ar,frnt,cnt); display(ar,frnt,rear);
}