Recursive functions in Bash Scripting - Step-by-Step Execution

Concept Flow - Recursive functions

Call function with n

↓

Check base case: n == 0?

Yes→Return base value

No↓

Call function with n-1

↓

Receive result from smaller call

↓

Combine result with current n

↓

Return combined result

↩Back to previous call or end

The function calls itself with a smaller input until it reaches a base case, then returns values back up the call chain.

Execution Sample

Bash Scripting

#!/bin/bash
factorial() {
  if [ $1 -eq 0 ]; then
    echo 1
  else
    local prev=$(factorial $(( $1 - 1 )))
    echo $(( $1 * prev ))
  fi
}
factorial 3

Calculates factorial of 3 by calling itself with decreasing numbers until 0, then multiplies results back up.

Execution Table

Step	Function Call	Parameter n	Base Case?	Action	Output
1	factorial 3	3	No	Call factorial 2
2	factorial 2	2	No	Call factorial 1
3	factorial 1	1	No	Call factorial 0
4	factorial 0	0	Yes	Return 1	1
5	factorial 1	1	No	Calculate 1 * 1	1
6	factorial 2	2	No	Calculate 2 * 1	2
7	factorial 3	3	No	Calculate 3 * 2	6
8	End			All calls returned	6

💡 Reached base case at n=0, then returned results up the call stack until original call completed.

Variable Tracker

Variable	Start	After Step 4	After Step 5	After Step 6	After Step 7	Final
n	3	0 (in deepest call)	1	2	3	3
prev		1	1	2	6	6
Output		1	1	2	6	6

Key Moments - 3 Insights

Why does the function call itself with n-1 instead of n+1?

Because the function needs to reach the base case where n=0 by decreasing n each time, as shown in execution_table steps 1-4.

What happens when the base case is reached?

The function returns 1 immediately without further calls, as seen in step 4, which stops the recursion from continuing infinitely.

How does the function combine results from recursive calls?

Each call waits for the smaller call to return, then multiplies the returned value by its own n, shown in steps 5-7.

Visual Quiz - 3 Questions

Look at the execution table, what is the output when factorial is called with n=1 (step 5)?

A 0

B 2

C 1

D 3

💡 Hint

Check the Output column at step 5 in the execution_table.

At which step does the base case occur in the execution table?

A Step 4

B Step 7

C Step 1

D Step 3

💡 Hint

Look for the row where Base Case? is Yes.

If the base case returned 0 instead of 1, what would be the final output for factorial 3?

A 6

B 0

C 3

D 1

💡 Hint

Consider how multiplication with 0 affects the final result in the variable_tracker.

Concept Snapshot

Recursive functions call themselves with smaller inputs.
They must have a base case to stop recursion.
Each call waits for the smaller call to return.
Results combine as calls return back up.
In bash, use local variables to store recursive results.
Always test base case to avoid infinite loops.

Full Transcript

This example shows a bash recursive function calculating factorial. The function calls itself with n-1 until it reaches 0, the base case, where it returns 1. Then each call multiplies its n by the returned value from the smaller call. The execution table traces each call and return step. Variables n and prev change as recursion deepens and unwinds. Key moments clarify why n decreases, what base case means, and how results combine. The quiz tests understanding of outputs and base case location. The snapshot summarizes recursion essentials in bash scripting.

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