Common pointer mistakes in C++ - Time & Space Complexity

Time Complexity: Common pointer mistakes

O(n)

Understanding Time Complexity

When working with pointers, it is important to understand how operations involving them affect program speed.

We want to see how the time to run code changes as the input size grows when pointers are used.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

void printArray(int* arr, int size) {
    for (int i = 0; i < size; i++) {
        std::cout << *(arr + i) << " ";
    }
    std::cout << std::endl;
}
    

This code prints all elements of an integer array using a pointer.

Identify Repeating Operations

• Primary operation: Loop that accesses each element via pointer arithmetic.
• How many times: Exactly once for each element in the array (size times).

How Execution Grows With Input

As the array size grows, the number of pointer accesses grows directly with it.

Input Size (n)	Approx. Operations
10	10 pointer accesses and prints
100	100 pointer accesses and prints
1000	1000 pointer accesses and prints

Pattern observation: The work grows evenly as the input size grows.

Final Time Complexity

Time Complexity: O(n)

This means the time to run the code grows in direct proportion to the number of elements.

Common Mistake

[X] Wrong: "Using pointers makes the code run instantly or in constant time regardless of input size."

[OK] Correct: Even with pointers, you still need to visit each element to process it, so time grows with input size.

Interview Connect

Understanding how pointer operations scale helps you write efficient code and explain your reasoning clearly in interviews.

Self-Check

"What if we changed the loop to process only every other element? How would the time complexity change?"