Queue Algorithms

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

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

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

Insert an element at the rear 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 highest-priority element from a sorted-array priority queue (shifts remaining elements; O(n) array shift, O(log n) if binary heap).

Insert into a sorted-array priority queue at the matching priority slot (shifts elements; O(n) array shift, O(log n) if binary heap).

Model a FIFO queue with front and rear ends.

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