Null coalescing in conditions in PHP - Time & Space Complexity

Time Complexity: Null coalescing in conditions

O(n)

Understanding Time Complexity

We want to see how using null coalescing in conditions affects how long the code takes to run.

Specifically, does it change how the program grows when input gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

$values = [null, 2, null, 4, 5];
foreach ($values as $value) {
    $result = $value ?? 10;
    if ($result > 3) {
        echo $result . "\n";
    }
}
    

This code checks each value, uses 10 if it is null, and prints it if it is bigger than 3.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each element in the array.
• How many times: Once for every item in the array.

How Execution Grows With Input

Each new item adds one more check and possible print.

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

Pattern observation: The work grows evenly with the number of items.

Final Time Complexity

Time Complexity: O(n)

This means the time to run grows in a straight line with the number of items.

Common Mistake

[X] Wrong: "Using the null coalescing operator makes the code run faster or slower in a big way."

[OK] Correct: The null coalescing operator is just a quick check and does not add loops or nested work, so it does not change how the time grows with input size.

Interview Connect

Understanding how simple operators affect time helps you explain your code clearly and shows you know what really matters for performance.

Self-Check

"What if we replaced the null coalescing operator with a nested if-else inside the loop? How would the time complexity change?"