Recursive functions in Bash Scripting - Time & Space Complexity

Time Complexity: Recursive functions

O(n)

Understanding Time Complexity

When we use recursive functions in bash scripting, it is important to understand how the time needed grows as the input gets bigger.

We want to know how many times the function calls itself and how that affects the total work done.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

factorial() {
  local n=$1
  if (( n <= 1 )); then
    echo 1
  else
    local prev=$(factorial $((n - 1)))
    echo $((n * prev))
  fi
}

factorial 5

This code calculates the factorial of a number using recursion, calling itself with smaller numbers until it reaches 1.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The function calls itself once per number from n down to 1.
• How many times: Exactly n times, where n is the input number.

How Execution Grows With Input

Each time we increase n by 1, the function makes one more recursive call, so the total work grows steadily.

Input Size (n)	Approx. Operations
10	10 calls
100	100 calls
1000	1000 calls

Pattern observation: The number of calls grows directly with n, so doubling n doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to finish grows in a straight line with the size of the input number.

Common Mistake

[X] Wrong: "Recursive functions always take much longer than loops because they call themselves many times."

[OK] Correct: In this case, the recursive function calls itself once per step, just like a loop would. So the time grows the same way as a simple loop.

Interview Connect

Understanding how recursion grows helps you explain your code clearly and shows you can think about efficiency, which is a great skill in scripting and automation.

Self-Check

"What if the recursive function called itself twice each time? How would the time complexity change?"

Practice

1. What is the main purpose of a base case in a recursive Bash function?

easy

A. To increase the input value for the next call

B. To call the function again with the same input

C. To print the current value of a variable

D. To stop the recursion and prevent infinite loops

Solution

1. Step 1: Understand recursion basics

   A recursive function calls itself repeatedly with smaller inputs.

2. Step 2: Role of base case

   The base case stops the recursion to avoid infinite loops and eventual crash.

3. Final Answer:

   To stop the recursion and prevent infinite loops -> Option D

4. Quick Check:

   Base case = stop recursion [OK]

Hint: Base case always stops recursion to avoid endless calls [OK]

Common Mistakes:

• Forgetting the base case causes infinite recursion
• Using base case to increase input instead of stopping
• Confusing base case with recursive step

2. Which of the following is the correct syntax to define a recursive function named countdown in Bash?

easy

A. countdown() { while [ $1 -gt 0 ]; do echo $1; (( $1-- )); done; echo Done; }

B. def countdown(n): if n <= 0: print('Done') else: print(n) countdown(n-1)

C. function countdown() { if [[ $1 -le 0 ]]; then echo Done; else echo $1; countdown $(( $1 - 1 )); fi }

D. function countdown { echo $1; countdown $(( $1 - 1 )); }

Solution

1. Step 1: Identify Bash function syntax

   Bash functions use the syntax: function name() { commands; } or name() { commands; }.

2. Step 2: Check recursive call and base case

   function countdown() { if [[ $1 -le 0 ]]; then echo Done; else echo $1; countdown $(( $1 - 1 )); fi } correctly defines a function with a base case (if $1 <= 0) and recursive call countdown $(( $1 - 1 )).

3. Final Answer:

   function countdown() { if [[ $1 -le 0 ]]; then echo Done; else echo $1; countdown $(( $1 - 1 )); fi } -> Option C

4. Quick Check:

   Bash recursion syntax = function countdown() { if [[ $1 -le 0 ]]; then echo Done; else echo $1; countdown $(( $1 - 1 )); fi } [OK]

Hint: Look for Bash syntax with base case and recursive call [OK]

Common Mistakes:

• Using Python syntax in Bash function
• Missing base case causing infinite recursion
• Incorrect function declaration without parentheses

3. What will be the output of this Bash script?

factorial() {
  if [[ $1 -le 1 ]]; then
    echo 1
  else
    local prev=$(factorial $(( $1 - 1 )))
    echo $(( $1 * prev ))
  fi
}
factorial 3

medium

A. 1

B. 6

C. 3

D. 9

Solution

1. Step 1: Understand factorial recursion

   factorial(3) calls factorial(2), which calls factorial(1). factorial(1) returns 1.

2. Step 2: Calculate factorial values

   factorial(2) = 2 * 1 = 2; factorial(3) = 3 * 2 = 6.

3. Final Answer:

   6 -> Option B

4. Quick Check:

   3! = 6 [OK]

Hint: Factorial n = n * factorial(n-1), factorial(1) = 1 [OK]

Common Mistakes:

• Confusing multiplication order
• Forgetting base case returns 1
• Assuming output is input value

4. Identify the error in this recursive Bash function that calculates the sum of numbers from 1 to n:

sum() {
  if [[ $1 -eq 0 ]]; then
    echo 0
  else
    echo $(( $1 + sum $(( $1 - 1 )) ))
  fi
}
sum 3

medium

A. Using echo inside arithmetic expression causes error

B. Missing base case for $1 == 1

C. Function name 'sum' is a reserved keyword

D. Incorrect decrement syntax $(( $1 - 1 ))

Solution

1. Step 1: Analyze recursive call inside arithmetic

   The function calls sum recursively inside $(( ... )), but sum outputs text via echo, not a number directly.

2. Step 2: Understand Bash arithmetic limitations

   Bash arithmetic expects numbers, but echo outputs string with newline, causing error.

3. Final Answer:

   Using echo inside arithmetic expression causes error -> Option A

4. Quick Check:

   Echo inside $(( )) = error [OK]

Hint: Avoid echo inside $(( )); use command substitution instead [OK]

Common Mistakes:

• Assuming echo returns a number usable in arithmetic
• Ignoring base case correctness
• Thinking function name 'sum' is reserved

5. You want to write a recursive Bash function list_files that prints all files in a directory and its subdirectories. Which approach correctly handles recursion and avoids infinite loops?

hard

A. Check if the argument is a directory; if yes, list files and call list_files on each subdirectory; else print the file name

B. Call list_files on the directory without checking type, then print the directory name

C. Use a loop to list files only in the current directory without recursion

D. Call list_files on all files and directories without base case

Solution

1. Step 1: Understand recursive directory traversal

   To list files recursively, check if the argument is a directory; if so, process contents recursively.

2. Step 2: Avoid infinite loops by checking file type

   Only recurse into directories; print file names directly to avoid infinite recursion.

3. Final Answer:

   Check if the argument is a directory; if yes, list files and call list_files on each subdirectory; else print the file name -> Option A

4. Quick Check:

   Directory check + recursive call = correct recursion [OK]

Hint: Always check if input is directory before recursive call [OK]

Common Mistakes:

• Recursing without checking if input is directory
• Missing base case causing infinite recursion
• Not printing files when input is a file