Queue · FIFO

A queue removes items in the order they were added. This implementation stores them in a ring buffer.

Remember: First in, first out.

Example: Enqueue 2, enqueue 4, dequeue → 2.

Time: O(1) / op. Auxiliary space: O(capacity).

Formula: front = (front + 1) % capacity

A fixed ring buffer implements this queue. Output shows logical FIFO order.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.