Day 9: Recursion 3

Problem Link

• HackerRank Problem Link

Solution

• In C++ Language

Recursion.cpp

#include <bits/stdc++.h>

using namespace std;

int factorial(int num) ;

int main() 
{

    int n;
    cin >> n;
    cout << factorial(n) << endl;

    return 0;
}

int factorial(int num) 
{
    if(num == 1)
    {
        return 1;
    }
    else 
    {
    return (num * (factorial(num-1)));
    }
}