📊 Array Visualization
array[10] =
N=10
Array Size
→
O(1)
Operation Time
→
1
Steps
⚡ O(1) Operations
Array Access
arr[i]
Swap Elements
a ↔ b
Arithmetic
+, -, ×, ÷
Assignment
x = value
Comparison
a == b
Push/Pop
Stack ops
📚 Why O(1) is Constant Time
O(1) operations take the same amount of time regardless of input size. Whether your array has 10 elements or 10 million elements, accessing arr[5] always takes 1 step!
Key insight: Arrays store elements in contiguous
memory. The computer can calculate the exact memory address using:
base_address + (index × element_size)