Skip to main content

Loading page content

Array Stack

easy

T: O(1)S: O(1)

Capacity:

Array implementation with top index pointer • O(1)

State:

Active end

Top/front pointer

Inserted value

Removed value

Returned value

Operation complete

Capacity state

No element state is highlighted for this setup step.

Loading visualizer…

Pseudocode

1class ArrayStack:

2 top = -1, capacity = N

3 push(val): if top < capacity-1: arr[++top] = val

4 pop(): if top >= 0: return arr[top--]

No pseudocode line selected.

Loading syntax highlighter…

No code line selected.

Preparing step explanation…

Generate steps to inspect the execution log.