Recursion

Read first Task 26

A recursive function calls itself with a smaller input.

Task

What is factorial(5)?

The editor already contains a starting point. Change it until every check passes — the Next task button unlocks when it does.

What you start with

#include <iostream>
using namespace std;

int factorial(int n) {
    if (n <= 1) {
        return 1;
    }
    return n * factorial(n - 1);
}

int main() {
    cout << factorial(5) << endl;
    return 0;
}

C++ 1 automatic check Section 3 · Functions

Code editor Ctrl + Enter runs

#include <iostream>
using namespace std;

int factorial(int n) {
    if (n <= 1) {
        return 1;
    }
    return n * factorial(n - 1);
}

int main() {
    cout << factorial(5) << endl;
    return 0;
}

Run your code to see the output and the checks.

Your result

Submit your code to see results

Write your code in the middle column and press Run code.

Checks on this task:

Check 1

One correct answer:

Track progress

0 of 56 tasks complete

Next task unlocks when every check passes.

← Previous

Next task (pass every check first)

Recursion

Recursion

Task

Why this works