Prompting with read -p in Bash Scripting - Time & Space Complexity

Time Complexity: Prompting with read -p

O(n)

Understanding Time Complexity

When we use read -p in bash scripts, we ask the user for input. Understanding how long this takes helps us see how the script behaves as input grows.

We want to know how the script's running time changes when we ask for input multiple times.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

for i in $(seq 1 $n); do
  read -p "Enter value $i: " input
  echo "You entered: $input"
done
    

This script asks the user to enter a value n times, then prints each entered value.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The for loop that runs read -p and echo commands.
• How many times: Exactly n times, where n is the number of prompts.

How Execution Grows With Input

Each time we increase n, the script asks for input one more time, so the total work grows directly with n.

Input Size (n)	Approx. Operations
10	10 prompts and echoes
100	100 prompts and echoes
1000	1000 prompts and echoes

Pattern observation: The total steps increase evenly as n grows. Double n, double the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to run the script grows in a straight line with the number of times it asks for input.

Common Mistake

[X] Wrong: "The script runs in constant time because each prompt is quick."

[OK] Correct: Even if one prompt is quick, asking many times adds up. More prompts mean more total time.

Interview Connect

Understanding how loops with user input scale helps you explain script behavior clearly. This skill shows you can think about how scripts perform as tasks grow.

Self-Check

"What if we replaced the for loop with a while loop that runs until a user types 'exit'? How would the time complexity change?"