Pass statement usage in Python - Time & Space Complexity

Time Complexity: Pass statement usage

O(n)

Understanding Time Complexity

Let's see how the pass statement affects the time complexity of Python code.

We want to know if using pass changes how long the program takes as input grows.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

for i in range(n):
    if i % 2 == 0:
        pass
    else:
        print(i)

This code loops through numbers from 0 to n-1, does nothing for even numbers, and prints odd numbers.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: A loop running from 0 to n-1.
• How many times: Exactly n times.

How Execution Grows With Input

Each number from 0 to n-1 is checked once, so the work grows directly with n.

Input Size (n)	Approx. Operations
10	10 checks and actions
100	100 checks and actions
1000	1000 checks and actions

Pattern observation: The number of operations grows evenly as input size grows.

Final Time Complexity

Time Complexity: O(n)

This means the program takes longer in a straight line as the input number n gets bigger.

Common Mistake

[X] Wrong: "The pass statement makes the loop run faster or slower."

[OK] Correct: pass does nothing and does not add extra time; the loop still runs n times regardless.

Interview Connect

Understanding how simple statements like pass affect time helps you explain code efficiency clearly and confidently.

Self-Check

"What if we replaced pass with a function call inside the loop? How would the time complexity change?"