Section 5: Dynamic Arrays — Operations and Complexity (49–60)

Dynamic array size operation time complexity

$$O(1)$$

Dynamic array get operation time complexity

$$O(1)$$

Dynamic array set operation time complexity

$$O(1)$$

Dynamic array contains operation time complexity

$$O(n)$$

Dynamic array indexOf operation time complexity

$$O(n)$$

Amortized time complexity of appending to a dynamic array

$$O(1)$$

Worst-case time complexity of appending to a dynamic array when resizing

$O(n)$, because existing elements must be copied.

Time complexity of inserting at an arbitrary index in a dynamic array

$O(n)$, because elements may need to shift.

Time complexity of removing an element at an index in a dynamic array

$O(n)$, because elements may need to shift.

Time complexity of increasing dynamic array capacity

$O(n)$, because existing elements must be copied.

Space complexity of a dynamic array storing $n$ elements

$$O(n)$$

Reason indexed operations are efficient in a dynamic array

The backing array allows direct access by index.