Queue Algorithms

Remove and return the element at the rear of a double-ended queue.

Insert an element at the front of a double-ended queue.

Remove the front element from the queue.

Add an element to the rear of the queue.

Inspect both front and rear queue values.

Read the front queue value without removing it.

Remove and return the element with the highest priority from the queue.

Insert an element into a priority queue maintaining priority order.

Model a FIFO queue with front and rear ends.

Reuse freed positions by wrapping front and rear pointers around the array.