Queue.cpp

/******************************
  	Queue.cpp
    Auther:Syed Zain Ul hasan
  *****************************/

#include <iostream>

using namespace std;
const int MAX=6;
class Queue
{
private:
	int arr[MAX];
	int front;
	int rear;

public:
	Queue(){
		front=rear=0;
	}

	void Enqueue(int x){
		 if(full())
			  cout<<"Queue Full"<<endl;
		 else
		 {
			   arr[rear]=x;
			   rear=(rear+1)% MAX;
		 }
	}

	void Dequeue(){
			if(empty())
				cout<<"\nQueue Empty "<<front<<endl;
			else {
					   front = (front + 1) % MAX;
			}
	}

	int Front(){
			if(empty()){
				cout<<"Queue Empty"<<endl;
				return 0;
			}
			else
				return arr[front];
	}

	bool empty(){
			return (front==rear);
	}
	bool full(){
		int difference=rear-front;
		return (difference==-1 || difference==MAX-1);
	}


};



int main() {

	Queue q;


	q.Enqueue(4);
	q.Enqueue(5);
	q.Enqueue(6);
	q.Enqueue(10);
	q.Enqueue(7);


	while(!q.empty())
	{
		cout<<q.Front()<<" ";
		q.Dequeue();
	}
	cout<<endl;


	return 0;
}