Time Complexity: Tilde expansion (~)
O(n)
0
0
Tilde expansion (~) in Bash Scripting - Time & Space Complexity
Understanding Time Complexity
We want to understand how the time it takes to process tilde expansion changes as the input grows.
Specifically, how does bash handle the shortcut for home directories when many paths use ~?
Scenario Under Consideration
Analyze the time complexity of the following bash snippet using tilde expansion.
for path in ~/docs ~/downloads ~/pictures; do
echo "$path"
done
This code loops over a few paths starting with ~ and prints each expanded path.
Identify Repeating Operations
Look for repeated actions that affect time.
- Primary operation: Expanding ~ to the full home directory path.
- How many times: Once per path in the loop (3 times here).
How Execution Grows With Input
Each time the script sees a path starting with ~, it replaces it with the home directory.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 10 expansions |
| 100 | 100 expansions |
| 1000 | 1000 expansions |
Pattern observation: The number of expansions grows directly with the number of paths using ~.
Final Time Complexity
Time Complexity: O(n)
This means the time to expand all ~ grows linearly with how many paths need expanding.
Common Mistake
[X] Wrong: "Tilde expansion happens once and then applies to all paths instantly."
[OK] Correct: Each path with ~ is expanded separately, so more paths mean more expansions.
Interview Connect
Understanding how simple expansions scale helps you reason about script performance and efficiency in real tasks.
Self-Check
What if we changed the script to use absolute paths instead of ~? How would the time complexity change?