Operator precedence and evaluation order in Python - Time & Space Complexity

Time Complexity: Operator precedence and evaluation order

O(n)

Understanding Time Complexity

When we write expressions with many operators, Python decides which parts to calculate first. This order affects how many steps the program takes.

We want to understand how the order of operations affects the total work done as the input changes.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def calculate_sum(n):
    total = 0
    for i in range(n):
        total += i * 2 + 3 // (1 + 1)
    return total

This code calculates a sum by repeating a calculation involving multiple operators inside a loop.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The loop runs the calculation inside it for each number from 0 up to n-1.
• How many times: The calculation runs exactly n times, once per loop cycle.

How Execution Grows With Input

Each time n grows, the loop runs more times, doing the same calculation each time.

Input Size (n)	Approx. Operations
10	About 10 calculations
100	About 100 calculations
1000	About 1000 calculations

Pattern observation: The total work grows directly with n; doubling n doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to finish grows in a straight line as the input size grows.

Common Mistake

[X] Wrong: "Because there are many operators in the calculation, the time grows faster than the loop count."

[OK] Correct: The operators inside the loop run a fixed number of steps each time, so they don't add extra growth beyond the loop itself.

Interview Connect

Understanding how operator order affects repeated calculations helps you explain how code runs step-by-step, a skill useful in many programming tasks.

Self-Check

"What if the calculation inside the loop called another function that itself loops n times? How would the time complexity change?"