Array Operations

fundamentalrandom-access

Press play to start

1const arr: number[] = [10, 20, 30, 40, 50]
2// Access: O(1)
3const val = arr[2]  // 30
4// Insert at index i: O(n)
5arr.splice(2, 0, 25)  // [10,20,25,30,40,50]
6// Delete at index i: O(n)
7arr.splice(1, 1)  // [10,25,30,40,50]
8// Linear search: O(n)
9function linearSearch(arr: number[], t: number): number {
10  for (let i = 0; i < arr.length; i++) {
11    if (arr[i] === t) return i
12  }
13  return -1
14}

Step 1/0

Complexity

Best:O(1)
Average:O(n)
Worst:O(n)
Space:O(1)

Description

Fundamental operations on arrays: access, insertion, deletion, and search. The foundation of most data structure implementations.

When to use

Arrays provide O(1) random access and are cache-friendly. Use when index-based access is frequent and size is known.