Constants and literals in C++ - Time & Space Complexity

Time Complexity: Constants and literals

O(1)

Understanding Time Complexity

When we use constants and literals in code, it's important to know how they affect the program's speed.

We want to see how the time to run the code changes as the input size grows.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

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

This code uses constants and literals to do a simple addition and return the result.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: A single addition operation using constants and variables.
• How many times: Exactly once, no loops or repeated steps.

How Execution Grows With Input

Explain the growth pattern intuitively.

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

Pattern observation: The number of operations stays the same no matter how big the input is.

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: "Using constants or literals makes the program slower because they add extra steps."

[OK] Correct: Constants and literals are simple values that the computer handles instantly, so they don't slow down the program.

Interview Connect

Understanding that constants and literals do not affect time complexity helps you focus on the parts of code that really matter for performance.

Self-Check

"What if we replaced the constant with a loop that repeats the addition multiple times? How would the time complexity change?"