@author Ankit Singh
GLA university mathura (u.p)

PriorityQueueUsingArray

Full implementation of Priority queue using Array in java.

1. enqueue/insert
   if (front=rear=-1), then (front=rear=0), insert
   if(rear != size), then rear++, insert
   sort on the basis max/min priority

2. dequeue/remove
   if(front=rear=-1) or (front > rear),means no element in queue
   if (front<=rear), front++

3. peek
   if( front=rear=-1), queue is empty
   else print, front value

4.isEmpty\

##..Thank you..##