Style guide and conventions in Bash Scripting - Time & Space Complexity

Time Complexity: Time complexity

O(n)

Understanding Time Complexity

When writing bash scripts, understanding time complexity helps ensure they scale well with larger inputs.

We want to see how the script's running time grows as the input size increases.

Scenario Under Consideration

Analyze the time complexity of the following bash script snippet.

#!/bin/bash

for file in /var/log/*; do
  if [[ $file == *.log ]]; then
    echo "Processing $file"
  fi
done

This script lists files in /var/log and prints a message for each file ending with .log.

Identify Repeating Operations

Look for loops or repeated actions in the script.

• Primary operation: The for loop goes through each file in the directory.
• How many times: Once for every file found in /var/log.

How Execution Grows With Input

As the number of files grows, the script runs more checks and prints more messages.

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

Pattern observation: The work grows directly with the number of files.

Final Time Complexity

Time Complexity: O(n)

This means the script takes longer in a straight line as the number of files increases.

Common Mistake

[X] Wrong: "Using ls inside the loop makes it slower each time."

[OK] Correct: The ls runs once before the loop starts, so it does not repeat inside the loop.

Interview Connect

Understanding how loops grow with input helps you write scripts that stay fast and clear as they handle more data.

Self-Check

"What if we replaced ls /var/log with a command that lists files recursively? How would the time complexity change?"