Circular Queue Array

#include <iostream>

#define capacity 5

using namespace std;



class ArrayQueue {

public:

int size;

int myFrontPos, myBackPos;

int array[capacity];

ArrayQueue(){

 size=0;

 myFrontPos=0;

 myBackPos=0;

}



void enqueue(int number) {

 int newBack=(myBackPos+1)%capacity;

 if (size==capacity) {

  cout<<"queue is full!!"<<endl;

 } else {

  array[myBackPos]=number;

  myBackPos=newBack;

  size++;

 }

}



void dequeue() {

 if (size==0) {

  cout<<"queue is empty!!"<<endl;

 } else {

  myFrontPos=(myFrontPos+1)%capacity;

  size--;;

 }



}



void display() {

 for(int i=0;i<size;i++){

  cout <<array[i]<<endl;

 }



}



};



int main() {

ArrayQueue aq;

aq.enqueue(1);

aq.enqueue(2);

aq.enqueue(3);

aq.enqueue(4);

aq.enqueue(5);

aq.dequeue();

aq.enqueue(6);

aq.display();

return 0;

}