A priority queue is a queue in which we insert an element at the back (enqueue) and remove an element from the front (dequeue). In addition, every element has a priority associated with it. The element with the highest priority shall be dequeued first. The Priority queue can be implemented with array or heap.

There are two ways to implement with array. The first is to implement as an ordered array. All element are ordered when insert. To dequeue, remove the last element which has the highest priority. The second way is to allow new element to enter in an arbitrary order. To dequeue, find the highest priority element by checking all elements and remove it. This post is using unordered array.

Part 1 – priority queue implementation with ordered array
Part 2 – priority queue implementation with unordered array
Part 3 – priority queue implementation with heap iterative solution
Part 4 – priority queue implementation with heap recursive solution

### Enqueue

To enqueue an element is the same as adding an element in a regular array -add the element at next available spot in the array (ie at the end).

## Doodle

### Dequeue

The dequeue operation is to remove the highest priority element from the array. Since the array is not ordered, we have to find the highest priority element first. This requires to exam all elements in the array. Then move the last element in the array to this spot to replace (remove) it. This time complexity is O(n).

## Python

### Peek

Peek is to return the value of the highest priority element. The same as dequeue, we have to find the highest priority element by examing all elements in the array.

## Python

### Print

Print is to print all elements in the array, starting from the index 0 to highest index. A for loop is used to iterate through each element.