Array Operations

Contiguous Memory: Arrays are stored in sequential memory blocks. Notice how the addresses (e.g., 0x100, 0x104) increase by 4 bytes for each integer.

• Access O(1): Because memory is contiguous, the computer calculates the exact address using: Base + (Index * 4).
• Insertion O(n): Inserting an element requires shifting all subsequent elements to the right to make space.
• Deletion O(n): Deleting an element requires shifting all subsequent elements to the left to fill the gap.