Array-Based Queue
FIFO (First-In, First-Out) structure using a linear array.
Note: In a simple linear implementation, removed spaces at the front are not reused. See "Circular Queue" for optimization.
0
1
2
3
4
Status: Queue is empty.
Speed
Algorithm Logic
1function enqueue(val):
2 if rear == capacity - 1:
3 return Overflow
4 if front == -1: front = 0
5 rear++
6 queue[rear] = val
Capacity: 5