Recursive functions in R Programming

Introduction

Recursive functions help solve problems by calling themselves with smaller parts of the problem. This makes some tasks easier to understand and write.

When you want to break a big problem into smaller similar problems, like calculating factorial.

When working with data that has a repeating structure, like folders inside folders.

When you want to explore all possibilities, like in puzzles or games.

When you want to process items that depend on previous results, like Fibonacci numbers.

Syntax

R Programming

recursive_function <- function(parameter) {
  if (base_case_condition) {
    return(base_case_value)
  } else {
    return(recursive_function(smaller_parameter))
  }
}

The base case stops the recursion to avoid infinite loops.

Each recursive call should work on a smaller or simpler input.

Examples

Calculates factorial of a number using recursion.

R Programming

factorial <- function(n) {
  if (n == 0) {
    return(1)  # base case
  } else {
    return(n * factorial(n - 1))
  }
}

Shows the base case where recursion stops immediately.

R Programming

factorial(0)  # returns 1, base case example

Recursion calls factorial(0) next, then multiplies.

R Programming

factorial(1)  # returns 1, smallest positive number factorial

Example of multiple recursive calls until base case.

R Programming

factorial(5)  # returns 120, recursive calls multiply down to base case

Sample Program

This program defines a recursive function to calculate factorial. It prints the factorial of 5 and the base case factorial of 0.

R Programming

factorial <- function(number) {
  if (number == 0) {
    return(1)  # base case
  } else {
    return(number * factorial(number - 1))
  }
}

# Print factorial of 5
print(paste("Factorial of 5 is", factorial(5)))

# Print factorial of 0 (edge case)
print(paste("Factorial of 0 is", factorial(0)))

Important Notes

Time complexity is O(n) because the function calls itself n times.

Space complexity is O(n) due to the call stack growing with each call.

Common mistake: forgetting the base case causes infinite recursion and crashes.

Use recursion when the problem naturally breaks down into smaller similar problems; otherwise, loops might be simpler.

Summary

Recursive functions call themselves with smaller inputs.

Always include a base case to stop recursion.

Useful for problems like factorial, Fibonacci, and tree traversal.

Practice

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

easy

A. To stop the recursion and prevent infinite calls

B. To call the function again with the same input

C. To increase the input size for the next call

D. To print the result of the recursion

Solution

1. Step 1: Understand recursion basics

   A recursive function calls itself repeatedly with smaller inputs.

2. Step 2: Identify the 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 calls -> Option A

4. Quick Check:

   Base case = stop recursion [OK]

Hint: Base case always stops recursion to avoid infinite loops [OK]

Common Mistakes:

• Forgetting the base case causes infinite recursion
• Thinking base case calls function again
• Confusing base case with recursive step

2. Which of the following is the correct syntax to define a recursive function fact in R that calculates factorial?

easy

A. fact <- function(n) { repeat n * fact(n - 1) }

B. fact <- function(n) { while(n > 0) n * fact(n - 1) }

C. fact <- function(n) { if(n == 1) n + fact(n - 1) }

D. fact <- function(n) { if(n == 0) 1 else n * fact(n - 1) }

Solution

1. Step 1: Check base case and recursive call

   fact <- function(n) { if(n == 0) 1 else n * fact(n - 1) } correctly uses if condition for base case (n == 0) and recursive call with n-1.

2. Step 2: Identify syntax errors in other options

   Options B, C, and D misuse loops or have wrong base case or missing else.

3. Final Answer:

   fact <- function(n) { if(n == 0) 1 else n * fact(n - 1) } -> Option D

4. Quick Check:

   Correct base case and recursive call syntax [OK]

Hint: Base case uses if, recursive call uses else with smaller input [OK]

Common Mistakes:

• Using loops instead of recursion
• Missing else leads to errors
• Wrong base case condition

3. What is the output of this R code?

fib <- function(n) {
  if (n <= 1) return(n)
  else return(fib(n-1) + fib(n-2))
}
fib(4)

medium

A. 5

B. 4

C. 3

D. 7

Solution

1. Step 1: Trace fib(4) calls

   fib(4) = fib(3) + fib(2); fib(3) = fib(2) + fib(1); fib(2) = fib(1) + fib(0)

2. Step 2: Calculate values bottom-up

   fib(1)=1, fib(0)=0; fib(2)=1+0=1; fib(3)=1+1=2; fib(4)=2+1=3

3. Final Answer:

   3 -> Option C

4. Quick Check:

   Fibonacci(4) = 3 [OK]

Hint: Fibonacci(4) = 3 by adding previous two values [OK]

Common Mistakes:

• Confusing index starting at 0 or 1
• Adding wrong recursive calls
• Forgetting base cases

4. Identify the error in this recursive R function to sum numbers from 1 to n:

sum_to_n <- function(n) {
  if (n == 1) return(1)
  else return(n + sum_to_n(n))
}
sum_to_n(3)

medium

A. The recursive call uses the same n, causing infinite recursion

B. The function should use a loop instead

C. The base case is missing

D. The return statement is outside the function

Solution

1. Step 1: Check recursive call argument

   The function calls sum_to_n(n) instead of sum_to_n(n-1), so input never decreases.

2. Step 2: Understand effect of error

   This causes infinite recursion because n stays the same and base case is never reached.

3. Final Answer:

   The recursive call uses the same n, causing infinite recursion -> Option A

4. Quick Check:

   Recursive call must reduce input [OK]

Hint: Recursive call must use smaller input to reach base case [OK]

Common Mistakes:

• Calling function with same argument
• Missing base case
• Confusing recursion with loops

5. Write a recursive R function flatten_list that takes a nested list of numbers and returns a flat vector of all numbers.
What is the correct approach?

hard

A. Use recursion but forget to combine results from recursive calls

B. Check if input is a list; if yes, recursively flatten each element and combine; else return the element as vector

C. Return the input directly without any processing

D. Use a for loop to iterate and append elements without recursion

Solution

1. Step 1: Identify recursive structure

   Nested lists require checking each element; if it's a list, call flatten_list recursively.

2. Step 2: Combine results properly

   Combine all flattened elements into one vector to get a flat list of numbers.

3. Final Answer:

   Check if input is a list; if yes, recursively flatten each element and combine; else return the element as vector -> Option B

4. Quick Check:

   Recursion + combine results = flatten list [OK]

Hint: Recursively flatten each list element and combine results [OK]

Common Mistakes:

• Not combining recursive results
• Forgetting to check if element is a list
• Using loops only without recursion