Assignment operators in PowerShell - Time & Space Complexity

Time Complexity: Assignment operators

O(n)

Understanding Time Complexity

We want to understand how the time it takes to run assignment operations changes as the amount of data grows.

Specifically, we ask: How does using assignment operators affect the speed of a script when working with different input sizes?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

$sum = 0
for ($i = 0; $i -lt $n; $i++) {
    $sum += $i
}
Write-Output $sum
    

This code adds numbers from 0 up to n-1 using the += assignment operator inside a loop.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The addition and assignment inside the loop using the += operator.
• How many times: This operation runs once for each number from 0 to n-1, so n times.

How Execution Grows With Input

As the input number n grows, the number of times the assignment happens grows the same way.

Input Size (n)	Approx. Operations
10	10 additions and assignments
100	100 additions and assignments
1000	1000 additions and assignments

Pattern observation: The number of operations grows directly with n, so doubling n doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to complete the assignments grows in a straight line with the size of the input.

Common Mistake

[X] Wrong: "Assignment operators like += take constant time no matter what, so the whole loop is always super fast and doesn't depend on n."

[OK] Correct: While each assignment is quick, the loop repeats it n times, so the total time grows with n, not fixed.

Interview Connect

Understanding how assignment inside loops affects time helps you explain script speed clearly and shows you can think about how code scales.

Self-Check

"What if we replaced the for loop with a nested loop that also uses assignment operators? How would the time complexity change?"