Fibonacci Using Recursion in DSA C# - Build from Scratch

Fibonacci Using Recursion

📖 Scenario: You are helping a friend understand how to calculate Fibonacci numbers using a simple method that calls itself. This method is called recursion. Fibonacci numbers are a sequence where each number is the sum of the two before it, starting with 0 and 1.

🎯 Goal: Build a small program that uses a recursive function to find the Fibonacci number at a given position.

📋 What You'll Learn

Create a variable to hold the position number in the Fibonacci sequence.

Create a recursive function called Fibonacci that takes an integer parameter n.

The function should return the Fibonacci number at position n.

Print the Fibonacci number for the given position.

💡 Why This Matters

🌍 Real World

Fibonacci numbers appear in nature, computer algorithms, and financial models. Understanding recursion helps solve problems that break down into smaller similar problems.

💼 Career

Recursion is a key concept in programming interviews and software development for tasks like tree traversal, sorting, and dynamic programming.

1

Create the Fibonacci position variable

Create an integer variable called position and set it to 7.

DSA C#

// Create an integer variable called position and set it to 7
// Your code here

Hint

Use int position = 7; to create the variable.

2

Define the recursive Fibonacci function

Define a recursive function called Fibonacci that takes an integer parameter n and returns an integer. The function should return n if n is 0 or 1. Otherwise, it should return the sum of Fibonacci(n - 1) and Fibonacci(n - 2).

DSA C#

int position = 7;
// Define the Fibonacci function below
// Your code here

Hint

Use if (n == 0 || n == 1) to check the base cases and call Fibonacci recursively for other cases.

3

Call the Fibonacci function

Create an integer variable called result and set it to the value returned by calling Fibonacci(position).

DSA C#

int position = 7;

int Fibonacci(int n)
{
    if (n == 0 || n == 1)
    {
        return n;
    }
    else
    {
        return Fibonacci(n - 1) + Fibonacci(n - 2);
    }
}

// Call Fibonacci with position and store in result
// Your code here

Hint

Use int result = Fibonacci(position); to call the function and save the answer.

4

Print the Fibonacci result

Print the value of the result variable using Console.WriteLine.

DSA C#

int position = 7;

int Fibonacci(int n)
{
    if (n == 0 || n == 1)
    {
        return n;
    }
    else
    {
        return Fibonacci(n - 1) + Fibonacci(n - 2);
    }
}

int result = Fibonacci(position);

// Print the result
// Your code here

Hint

Use Console.WriteLine(result); to show the Fibonacci number.

Practice

1. What does the Fibonacci sequence represent when calculated using recursion?

easy

A. Each number is the product of the two preceding numbers

B. Each number is the sum of the two preceding numbers

C. Each number is the difference of the two preceding numbers

D. Each number is the division of the two preceding numbers

Solution

1. Step 1: Understand Fibonacci sequence definition

   The Fibonacci sequence is defined such that each number is the sum of the two numbers before it.

2. Step 2: Apply to recursion context

   Recursion calculates this by calling the function for the two previous numbers and adding their results.

3. Final Answer:

   Each number is the sum of the two preceding numbers -> Option B

4. Quick Check:

   Fibonacci = sum of two previous numbers [OK]

Hint: Remember Fibonacci adds two previous numbers [OK]

Common Mistakes:

• Thinking Fibonacci multiplies previous numbers
• Confusing subtraction or division with addition
• Assuming Fibonacci uses only one previous number

2. Which of the following is the correct C# syntax to define a recursive Fibonacci function header?

easy

A. void Fibonacci(int n)

B. int Fibonacci()

C. int Fibonacci(int n)

D. int Fibonacci(int)

Solution

1. Step 1: Identify function return type and parameters

   The Fibonacci function returns an integer and takes an integer parameter for the position.

2. Step 2: Match correct C# syntax

   Correct syntax includes return type, function name, and parameter with type: int Fibonacci(int n)

3. Final Answer:

   int Fibonacci(int n) -> Option C

4. Quick Check:

   Function returns int and takes int parameter [OK]

Hint: Function must return int and take int parameter [OK]

Common Mistakes:

• Using void return type instead of int
• Missing parameter type or name
• Incorrect parameter list syntax

3. What is the output of this C# code snippet?

static int Fibonacci(int n) {
  if (n <= 1) return n;
  return Fibonacci(n - 1) + Fibonacci(n - 2);
}

Console.WriteLine(Fibonacci(4));

medium

A. 3

B. 5

C. 4

D. 7

Solution

1. Step 1: Calculate Fibonacci(4) using recursion

   Fibonacci(4) = Fibonacci(3) + Fibonacci(2). Fibonacci(3) = Fibonacci(2) + Fibonacci(1) = 1 + 1 = 2. Fibonacci(2) = Fibonacci(1) + Fibonacci(0) = 1 + 0 = 1. So Fibonacci(4) = 2 + 1 = 3.

2. Step 2: Confirm output

   The printed output is 3.

3. Final Answer:

   3 -> Option A

4. Quick Check:

   Fibonacci(4) = 3 [OK]

Hint: Trace calls down to base cases to sum results [OK]

Common Mistakes:

• Confusing Fibonacci(4) with Fibonacci(5)
• Miscounting base cases
• Adding wrong recursive results

4. Identify the error in this recursive Fibonacci function:

int Fibonacci(int n) {
  if (n == 0) return 0;
  if (n == 1) return 1;
  return Fibonacci(n - 1) - Fibonacci(n - 2);
}

medium

A. The recursive call uses subtraction instead of addition

B. Parameter type is missing

C. Function lacks return type

D. Base cases are incorrect

Solution

1. Step 1: Check base cases

   Base cases for n=0 and n=1 are correct and return 0 and 1 respectively.

2. Step 2: Analyze recursive return statement

   The function uses subtraction (Fibonacci(n - 1) - Fibonacci(n - 2)) instead of addition, which is incorrect for Fibonacci sequence.

3. Final Answer:

   The recursive call uses subtraction instead of addition -> Option A

4. Quick Check:

   Fibonacci sums previous two, not subtracts [OK]

Hint: Fibonacci adds two previous calls, not subtracts [OK]

Common Mistakes:

• Using subtraction instead of addition in recursion
• Forgetting to return in base cases
• Missing parameter or return type in function

5. How can you optimize the recursive Fibonacci function to avoid repeated calculations?

hard

A. Increase the recursion depth limit

B. Replace recursion with a while loop only

C. Use subtraction instead of addition in recursion

D. Use memoization to store and reuse computed values

Solution

1. Step 1: Understand problem with naive recursion

   Naive recursion recalculates Fibonacci values many times, causing inefficiency.

2. Step 2: Apply memoization technique

   Memoization stores results of Fibonacci calls in a cache to reuse, avoiding repeated work.

3. Final Answer:

   Use memoization to store and reuse computed values -> Option D

4. Quick Check:

   Memoization optimizes recursion by caching results [OK]

Hint: Cache results to avoid repeated recursive calls [OK]

Common Mistakes:

• Thinking only loops can optimize recursion
• Increasing recursion depth does not improve efficiency
• Using subtraction breaks Fibonacci logic