main function and program entry in C++ - Time & Space Complexity

Time Complexity: main function and program entry

O(1)

Understanding Time Complexity

We want to understand how the time a program takes changes when it starts running from the main function.

Specifically, we ask: How much work does the program do as it begins?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

int main() {
    int x = 5;
    int y = 10;
    int z = x + y;
    return 0;
}
    

This code starts the program, does a few simple calculations, and then ends.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Simple variable assignments and addition.
• How many times: Each operation runs only once, no loops or repeats.

How Execution Grows With Input

Since there are no loops or repeated steps, the work stays the same no matter the input size.

Input Size (n)	Approx. Operations
10	About 3 simple steps
100	About 3 simple steps
1000	About 3 simple steps

Pattern observation: The number of steps does not grow with input size; it stays constant.

Final Time Complexity

Time Complexity: O(1)

This means the program does a fixed amount of work when it starts, no matter how big the input is.

Common Mistake

[X] Wrong: "The main function always takes longer if the input is bigger."

[OK] Correct: The main function itself just starts the program and runs its code once. Unless it has loops or calls other functions that depend on input size, its work stays the same.

Interview Connect

Understanding that the main function is the starting point helps you see where programs begin and how their work can grow or stay steady. This clear view is useful when explaining how programs run.

Self-Check

"What if the main function included a loop that runs n times? How would the time complexity change?"