PHP Installation and Setup - Time & Space Complexity
When setting up PHP, we often run simple scripts to check if everything works. Understanding time complexity here helps us see how the setup affects running code as it grows.
We want to know how the time to run PHP scripts changes as the scripts get bigger or more complex.
Analyze the time complexity of the following PHP script that sums numbers from 1 to n.
<?php
function sumNumbers($n) {
$total = 0;
for ($i = 1; $i <= $n; $i++) {
$total += $i;
}
return $total;
}
echo sumNumbers(100);
?>
This code adds all numbers from 1 up to n and returns the total.
Look at what repeats in the code.
- Primary operation: The for-loop that adds numbers.
- How many times: It runs once for each number from 1 to n.
As n gets bigger, the loop runs more times, so the work grows steadily.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 10 additions |
| 100 | 100 additions |
| 1000 | 1000 additions |
Pattern observation: The number of operations grows directly with n. Double n, double the work.
Time Complexity: O(n)
This means the time to run the code grows in a straight line with the size of the input.
[X] Wrong: "The loop runs a fixed number of times, so time is always the same."
[OK] Correct: The loop runs as many times as n, so bigger n means more work and longer time.
Understanding how simple loops affect time helps you explain how your code scales. This skill shows you can think about efficiency, which is important in real projects.
"What if we changed the loop to run from 1 to n squared? How would the time complexity change?"