Go program structure - Time & Space Complexity

Time Complexity: Go program structure

O(1)

Understanding Time Complexity

We want to see how the time a Go program takes changes as it runs more code.

How does the program's structure affect how long it takes to run?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

package main

import "fmt"

func main() {
    fmt.Println("Hello, World!")
}

This code prints a simple message once when the program runs.

Identify Repeating Operations

Look for any repeated actions in the code.

• Primary operation: Printing a message once.
• How many times: Exactly one time.

How Execution Grows With Input

The program does the same single print no matter the input size.

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

Pattern observation: The work stays the same even if input grows.

Final Time Complexity

Time Complexity: O(1)

This means the program takes the same amount of time no matter how big the input is.

Common Mistake

[X] Wrong: "The program takes longer if I run it on a bigger computer or with more data."

[OK] Correct: This program does one simple action once, so input size or machine speed does not change how many steps it takes.

Interview Connect

Understanding simple program steps helps build a strong base for analyzing more complex code later.

Self-Check

"What if we added a loop to print the message n times? How would the time complexity change?"