Pointer declaration in Go - Time & Space Complexity

Time Complexity: Pointer declaration

O(1)

Understanding Time Complexity

When we declare pointers in Go, it's important to see how this affects the program's speed.

We want to know how the time to run changes as we use pointers.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

package main

func increment(val *int) {
    *val = *val + 1
}

func main() {
    x := 5
    increment(&x)
}

This code declares a pointer to an integer and uses it to increase the value by one.

Identify Repeating Operations

Look for any repeated actions that take time.

• Primary operation: Single pointer dereference and increment.
• How many times: Happens once in this example.

How Execution Grows With Input

Since the code runs a single operation, the time does not grow with input size.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The time stays the same no matter the input size.

Final Time Complexity

Time Complexity: O(1)

This means the operation takes the same amount of time no matter what.

Common Mistake

[X] Wrong: "Using pointers makes the program slower because it adds extra steps."

[OK] Correct: Accessing a pointer is just one quick step and does not slow down the program noticeably for simple operations.

Interview Connect

Understanding how pointers work and their time cost helps you write clear and efficient code, a skill valued in many programming tasks.

Self-Check

"What if the increment function was called inside a loop running n times? How would the time complexity change?"