/*************************************************************
* Queues are loaded from the rear and emptied from the 
* front. In this example with load a 5 item queue with 5 items
* and then add one more item. The item first added is removed,
* and everything else is moved up a notch.
*
*
* Empty queue
* N->N->N->N->N->
*
* add the number 3
* 3->N->N->N->N->
*
* add the number 7
* 7->3->N->N->N->
*
* Full queue
* 5->4->3->2->1->
* 
* add the number 8
* 8->5->4->3->2-> 1 goes in the garbage
*
*
*
**************************************************************/






public class BasicQueue
{
	int maxSize;
	int queArray[];
	int front;
	int rear;
	int nItems;

	public BasicQueue(int s)
	{
		maxSize = s;
		queArray = new int[maxSize];
		front = 0;
		rear = -1;
		nItems = 0;
	}


	public void insert(int j)
	{
		if(rear == maxSize-1){
			for(int i = 0; i<maxSize-1;i++){
				queArray[i]=queArray[i+1];
			}
		        queArray[4]=j;
			nItems++;
		}else{
			queArray[++rear]=j;
			nItems++;
		}
	}//end insert

	public void showQueue(){
		for(int i=0;i<5;i++){
			System.out.print(queArray[i]);
		}
		System.out.println(" endq");
	}




/******** end methods ****************/


	public static void main(String args[]){
		BasicQueue queue = new BasicQueue(5);
		queue.insert(5);
		queue.insert(4);
		queue.insert(3);
		queue.insert(2);
		queue.insert(1);
		queue.showQueue();
		queue.insert(8);
		queue.showQueue();
	}//end main



}//end class