Why Arrays Exist and What Problem They Solve in DSA Python - Why This Pattern

Mental Model

Arrays store many items in one place so you can find any item quickly by its position.

Analogy: Imagine a row of mailboxes where each mailbox has a number. You can open any mailbox directly if you know its number, without checking all the others.

Index:  [0] -> [1] -> [2] -> [3] -> [4]
Value:  10    20    30    40    50

Dry Run Walkthrough

Input: list: 10, 20, 30, 40, 50; find value at position 3

Goal: Show how arrays let us quickly find the value at a specific position without checking all items.

Step 1: Look at position 0 to 2 to reach position 3

Index:  [0] -> [1] -> [2] -> [3] -> [4]
Value:  10    20    30    40    50 ↑

Why: We need to find the value at position 3, so we count positions starting from 0.

Step 2: Access value directly at position 3

Index:  [0] -> [1] -> [2] -> [3] -> [4]
Value:  10    20    30    40↑   50

Why: Arrays let us jump straight to position 3 without checking other values.

Step 3: Return value 40 found at position 3

Index:  [0] -> [1] -> [2] -> [3] -> [4]
Value:  10    20    30    40    50

Why: We found the value quickly using the position number.

Result:

Index:  [0] -> [1] -> [2] -> [3] -> [4]
Value:  10    20    30    40    50
Answer: 40

Annotated Code

DSA Python

class Array:
    def __init__(self, elements):
        self.data = elements

    def get_value_at(self, index):
        if index < 0 or index >= len(self.data):
            return None  # handle invalid index
        return self.data[index]

# Driver code
arr = Array([10, 20, 30, 40, 50])
value = arr.get_value_at(3)
print(f"Value at position 3 is: {value}")

if index < 0 or index >= len(self.data):

check if the requested position is valid to avoid errors

return self.data[index]

directly access the value at the given position using array indexing

Output

Value at position 3 is: 40

Complexity Analysis

Time: O(1) because accessing any position in an array takes the same fixed time

Space: O(n) because the array stores n elements in a continuous block of memory

vs Alternative: Compared to linked lists, arrays allow instant access by position without walking through nodes, making lookups faster

Edge Cases

index is negative or greater than last position

returns None to indicate invalid position

DSA Python

if index < 0 or index >= len(self.data):

empty array

any access returns None because no positions exist

DSA Python

if index < 0 or index >= len(self.data):

When to Use This Pattern

When you need to store many items and quickly find any by position, think of arrays because they give direct access by index.

Common Mistakes

Mistake: Trying to access an index outside the array bounds causing errors
Fix: Always check if the index is valid before accessing the array

Summary

Arrays store multiple items in order and let you find any item fast by its position.

Use arrays when you want quick access to elements by their position number.

The key is that arrays let you jump directly to any position without checking others.