DATA STRUCTURES • ALGORITHMS

Array Update

Modifying the value of an element at a given index. In arrays, this is highly efficient because the exact memory location is known.

Time

O(1)

Space

O(1)

Key Principle 1

Direct index-based access

Key Principle 2

No shifting of elements required

Key Principle 3

Constant time complexity

Key Principle 4

Overwrites existing memory value

UPDATE_LAB
ARRAY:
Current Step
Updating element at index 2. Current: 30
Playback
Speed
Update Tracker⠿
INDEX2
OLD30
NEW99
Update Logic⠿
1// Direct access and update
2arr[index] = newValue;
3// O(1) constant time
4// No elements shifted
10
[0]
20
[1]
30
[2]
40
[3]
50
[4]

Loading Lab...