DATA STRUCTURES • ALGORITHMS

Dynamic Array

An array that can grow in size as elements are added. It works by allocating a larger underlying static array when the current one is full.

Time

Insert: O(1) Amortized

Space

O(N)

Key Principle 1

Automatic resizing (doubling)

Key Principle 2

Heap-based allocation

Key Principle 3

Used in ArrayList (Java), Vector (C++)

Key Principle 4

Efficient random access

DYNAMIC_ARRAY_LAB
INSERT DATA:
Current Step
Initialize dynamic array with capacity 2.
Playback
Heap Stats ⠿
SIZE0
CAPACITY2
STATUSReady
Growth Logic ⠿
1if (size == capacity) {
2    capacity *= 2;
3    int* newArr = new int[capacity];
4    copy(arr, arr + size, newArr);
5}
6arr[size++] = val;
CAPACITY: 2
Ø
[0]
Ø
[1]

Loading Lab...