Why generators are needed in PHP - Performance Analysis

Time Complexity: Why generators are needed

O(n)

Understanding Time Complexity

We want to understand why generators are useful when working with large data in PHP.

How does using generators affect the time it takes to process data?

Scenario Under Consideration

Analyze the time complexity of this code that uses a generator.

function numbersGenerator($n) {
    for ($i = 0; $i < $n; $i++) {
        yield $i;
    }
}

foreach (numbersGenerator(1000) as $number) {
    echo $number . "\n";
}
    

This code generates numbers from 0 to n-1 one by one without storing them all at once.

Identify Repeating Operations

Look at what repeats in the code.

• Primary operation: Loop runs from 0 to n-1, yielding one number each time.
• How many times: Exactly n times, once per number.

How Execution Grows With Input

As n grows, the loop runs more times, but only one number is handled at a time.

Input Size (n)	Approx. Operations
10	10 loop steps, 10 yields
100	100 loop steps, 100 yields
1000	1000 loop steps, 1000 yields

Pattern observation: The number of steps grows directly with n, but memory use stays small because values are generated one by one.

Final Time Complexity

Time Complexity: O(n)

This means the time to generate all numbers grows linearly with how many numbers we want.

Common Mistake

[X] Wrong: "Generators make the code run faster than a normal loop."

[OK] Correct: Generators do not speed up the total work; they just save memory by producing values one at a time instead of all at once.

Interview Connect

Understanding generators shows you can handle large data efficiently, a useful skill in many programming tasks.

Self-Check

"What if we changed the generator to return an array of all numbers instead? How would the time and memory use change?"