//CIS 610-251: Queues and Link Lists
//Assignment # 4 Question # 5
//Due Oct 14,1999
//Pripority Queue Ordered.

#include<iostream.h>

#define MAX 5

class Queue
{
private:
	int * queue;
	int rear,front,total;
	bool Insert2(int);
public:
	int pqMinDelete(void);
	bool Insert(int);
	void Empty();
	bool isEmpty();
	Queue();
};	


Queue::Queue()
{
	queue=new int[MAX];
	rear=front=total=0;
	
}

//EnQueue an integer n and Sort. 
//Successful insertion return true;
bool Queue::Insert(int n)
{

	if (Insert2(n))
	{
		
	int arr[MAX],tot=total,i,j,temp;
	for(i=0;i<tot;i++) arr[i]=pqMinDelete();
	for(j=0;j<tot;j++) 
	{
		for(i=j;i<tot;i++) 
		{
			if (arr[i]<arr[j]) {temp=arr[j];arr[j]=arr[i];arr[i]=temp;}
		}
	
	}
	for(i=0;i<tot;i++) Insert2(arr[i]);
	return true;
	}
	return false;
}




bool Queue::Insert2(int n)
{
	if (rear==MAX-1) 
	{
		if (front==0) 
			return false;
		else
		{rear=0;queue[rear]=n;total++;}
	}
	else
	{
		if (rear+1 == front)
			 return false;
		else 
		{
			rear++;
			queue[rear]=n;
			total++;
		}
	}
	return true;
}

//DeQueue an integer and return it.
int Queue::pqMinDelete()
{
		if (!isEmpty())
	{
		if(front==MAX-1)
		{
			front=0;
			total--;
			return queue[front];
		}
		else
		{
			front++;
			total--;
			return queue[front];
		}

	}
	return -1;
}


//true if Queue is Empty
bool Queue::isEmpty(void)
{
	return (front==rear)? true : false;
}

//render queue empty
void Queue::Empty(void)
{
	front=rear=total=0;
}


main()
{
	Queue q;
	q.Insert(9);
	q.Insert(3);
	q.Insert(7);


	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	return 0;
}