Compact and extract functions in PHP - Time & Space Complexity
We want to understand how the time it takes to run PHP's compact and extract functions changes as the number of variables grows.
How does the work inside these functions grow when we add more variables?
Analyze the time complexity of the following code snippet.
$var1 = 10;
$var2 = 20;
$var3 = 30;
// Create an array from variables
$array = compact('var1', 'var2', 'var3');
// Extract variables back from array
extract($array);
This code creates an array from named variables using compact, then restores those variables using extract.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Both
compactandextractloop through the list of variable names or array keys. - How many times: Once for each variable name given to
compactor each key in the array forextract.
As the number of variables increases, the functions do more work, roughly one step per variable.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 steps |
| 100 | About 100 steps |
| 1000 | About 1000 steps |
Pattern observation: The work grows directly in proportion to the number of variables.
Time Complexity: O(n)
This means the time to run compact or extract grows linearly with the number of variables involved.
[X] Wrong: "compact and extract run instantly no matter how many variables there are."
[OK] Correct: Both functions must look at each variable name or array key, so more variables mean more work and more time.
Understanding how built-in functions like compact and extract scale helps you reason about performance in real projects and shows you can think about code efficiency clearly.
"What if we passed an array with nested arrays to extract? How would the time complexity change?"