DATA STRUCTURES • ALGORITHMS

Array Deletion

Removing an element from an array at a specific index. Subsequent elements must be shifted to the left to fill the resulting gap.

Time

O(N) (Worst Case)

Space

O(1)

Key Principle 1

Shifting left to fill gaps

Key Principle 2

O(1) if deleted from the end

Key Principle 3

Requires index validity check

Key Principle 4

Decreases active element count

DELETION_LAB
ARRAY:
Current Step
Deleting index 1 (Value: 20).
Playback
Speed
Deletion Stats ⠿
POS1
VAL20
SIZE5
Shift Logic ⠿
1// Find element and delete
2for (int i = pos; i < size - 1; i++) {
3    arr[i] = arr[i + 1];
4}
5size--;
6// Gap closed by left shifting
10
[0]
20
[1]
30
[2]
40
[3]
50
[4]

Loading Lab...