Recursive function

What is a Recursive Function in JavaScript?

A recursive function is a function that calls itself in order to solve a problem. It's like a loop, but instead of repeating a block of code, it calls itself with a smaller piece of the problem.

Why Use Recursive Functions?

1. Breaking Down Problems: Recursive functions are useful when a problem can be divided into smaller, similar problems.

2. Cleaner Code: For some problems, recursion can make the code simpler and easier to understand compared to using loops.

Key Components

1. Base Case: This is the condition that stops the recursion. Without it, the function would call itself forever.
2. Recursive Case: This is where the function calls itself with a smaller part of the problem, moving towards the base case.

Funny samples:

1. Running Competition:

function runOrder(countDown) {
    if (countDown <= 0) {
        console.log('Goo...!!!')
        return;
    }
    console.log(countDown)
    runOrder(countDown - 1)
}
runOrder(4);
// 4
// 3
// 2
// 1
// Goo...!!!

1. Knock Knock

function knockKnock(times) {
    if (times <= 0) {
        console.log(`Who's there?`)
        return
    }
    console.log(times)
    knockKnock(times-1)
}
knockKnock(3);
// 3
// 2
// 1
// Who's there?