Recursion Concept and Call Stack Visualization in DSA C - Build from Scratch

Recursion Concept and Call Stack Visualization

📖 Scenario: Imagine you have a stack of boxes, and you want to find out how many boxes are in the stack by taking one box off at a time until none are left. This is similar to how recursion works in programming, where a function calls itself to solve smaller parts of a problem.

🎯 Goal: You will write a simple recursive function in C to count down from a number to zero, printing each step. This will help you understand how recursion works and how the call stack grows and shrinks.

📋 What You'll Learn

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

The function should print the current value of n.

If n is greater than zero, the function should call itself with n - 1.

Create a variable start with the value 5 to begin the countdown.

Call the countdown function with start.

Print the message "Countdown complete!" after the recursion finishes.

💡 Why This Matters

🌍 Real World

Recursion is used in many real-world problems like searching files in folders, solving puzzles, and processing tree structures.

💼 Career

Understanding recursion is important for software developers, especially when working with algorithms, data structures, and problem-solving.

1

Create the countdown function declaration

Write the function declaration for void countdown(int n) in C. Inside the function, add a printf statement to print the current value of n in the format "%d\n".

DSA C

#include 

// Define the countdown function
// Your code here

Hint

Use void countdown(int n) to declare the function. Use printf("%d\n", n); to print the number.

2

Add the recursive call inside countdown

Inside the countdown function, add an if statement that checks if n is greater than zero. If true, call countdown(n - 1) to continue the countdown.

DSA C

#include 

void countdown(int n) {
    printf("%d\n", n);
    // Add recursive call if n > 0
    // Your code here
}

Hint

Use if (n > 0) to check the condition, then call countdown(n - 1); inside the block.

3

Create the start variable and call countdown

In the main function, create an integer variable called start and set it to 5. Then call the countdown function with start as the argument.

DSA C

#include 

void countdown(int n) {
    printf("%d\n", n);
    if (n > 0) {
        countdown(n - 1);
    }
}

int main() {
    // Create start variable and call countdown
    // Your code here
    return 0;
}

Hint

Declare int start = 5; and call countdown(start); inside main.

4

Print completion message after recursion

After calling countdown(start) in main, add a printf statement to print "Countdown complete!\n".

DSA C

#include 

void countdown(int n) {
    printf("%d\n", n);
    if (n > 0) {
        countdown(n - 1);
    }
}

int main() {
    int start = 5;
    countdown(start);
    // Print completion message
    // Your code here
    return 0;
}

Hint

Use printf("Countdown complete!\n"); after the recursive call.