NeuralNinjas • DSA Lab — QUEUE (Ultra Visual FIFO)

NeuralNinjas • Queue Lab

Ultra-Visual FIFO Simulation

Live

How each type works (quick)

Simple Queue: uses a fixed array. FRONT and REAR move forward. When REAR reaches the end, it can become "full" even if there are empty slots at the start (classic wasted space).

Circular Queue: also fixed array, but indices wrap: (i + 1) % capacity. This reuses freed slots.

Deque: double-ended queue. You can add/remove from both ends: ENQ_FRONT, ENQ_REAR, DEQ_FRONT, DEQ_REAR.

Priority Queue (concept): elements leave by priority (here: higher number/lexicographic first). Insert may shift elements → ENQUEUE can be O(n) in array form.

Controls

Queue Type

Capacity

Best visuals: 8–12

Value

No keyboard shortcuts. Only buttons.

Animation Speed

1.00x

Live narration

Ready. Use ENQUEUE_REAR(x). Watch pointers move.

⚡ QUEUE Arena

FRONT = -1

REAR = -1

Size = 0

Cap = 10

Type = simple

Zoom 100%

Queue Track

FIFO: First In → First Out

Flow: FRONT → REAR

QUEUE IS EMPTY

FRONT (-1)

REAR (-1)

Live Complexity Dashboard

Updates after every operation (counts + measured time)

What just happened?

ENQ_REAR: O(1)

DEQ_FRONT: O(1)

FRONT: O(1)

REAR: O(1)

IsEmpty: O(1)

IsFull: O(1)

SEARCH: O(n)

Simple array queue may waste space when FRONT moves forward.

Live Counters + Time

Enqueue calls

0

Dequeue calls

0

Search calls

0

Front calls

0

Rear calls

0

Last op time

—

X

Title

Message