Loop queue (Array storage)

#include <iostream>
using namespace Std;
#define MAXSIZE 100
Class Qune
{
Public
int data[maxsize];
int front;
int rear;
};
void Qinsert (Qune&a,int x); Team
int Qdelete (QUNE&A); Out Team
int main ()
{
Qune A;
A.front = A.rear =-1; Initializing an empty queue
}
void Qinsert (Qune&a,int x)
{
if ((a.rear + 1)% Maxsize = = A.front) {//To determine the queue is full, the maximum number of elements in the queue storage is Maxsize-1
cout << "Queue full";
return;
}
A.rear = (a.rear + 1)% Maxsize; Loop queue, number of insertions at the end of the team
A.data[a.rear] = = x;
}
int Qdelete (QUNE&A)
{
if (a.rear== a.front) {
cout << "queue is empty";
return 0;
}
A.front = (a.front + 1)% Maxsize; Out of the team in front of the team
return A.data[a.front];
}

Loop queue (Array storage)