Linear_Queue_Task_3.cpp

#include<iostream>
using namespace std;
#define SIZE 50
class Enqueue{
	int arr[SIZE];
	int front, rear;
	public:
		Enqueue(){
			front = -1;
			rear = -1;
		}
		bool isfull(){
			return (rear == SIZE - 1);
		}
		bool isempty(){
			return (front == -1 && rear == -1);
		}
		void enqueue(int x){
			if(isfull()){
				cout<<"Queue is full!"<<endl;
				return;
			}
			if(isempty()){
				front = 0;
			} 
			rear++;
			arr[rear]=x;
//			cout<<x<<" inserted."<<endl;
        }
        void dequeue(){
        	if(isempty()){
        		cout<<"Queue is empty!"<<endl;
        		return;
			}
//			cout<<arr[front]<<" removed."<<endl;
			if(front == rear){
				front = rear = -1;
			} else {
				front++;
			}
		}
		void display(){
			if(isempty()){
				cout<<"Queue is empty!"<<endl;
			} else {
				cout<<"Queue elements: ";
				for(int i=front;i<=rear;i++){
					cout<<arr[i]<<" ";
				}
				cout<<endl;
			}
		}
};
int main(){
	Enqueue E;
	E.enqueue(10);
	E.enqueue(20);
	E.enqueue(30);
	E.enqueue(40);
	E.enqueue(50);
	
	E.dequeue();
	E.dequeue();
//	E.dequeue();
//	E.dequeue();
//	E.dequeue();
	
	E.display();
	if(E.isempty()){
		cout<<"Queue is empty!"<<endl;
	} else {
        cout<<"Queue is not empty!"<<endl;
	}
	return 0;
}