The approach used in the implementation of the priority queue using an array is simple. A structure is created to store the values and priority of the element and then the array of that structure is created to store the elements. The following operations are involved in this implementation: 1. enqueue()-This function inserts the elements at the end of the queue. 2. peek() - This function will traverse the array to return the element with the highest priority. If it finds two elements having the same priority, it returns the highest value element among them. 3. dequeue() - This function will shift all the elements, 1 position to the left of the element returned by the peek() function and decrease the size.