Hackerrank | 30 days of code | Day 9-Solution in c++| Recursion-hackerrank-Solution-in-c++

Hackerrank | 30 days of code | Day 9-Solution in c++| Recursion-hackerrank-Solution-in-c++

https://www.hackerrank.com/challenges/30-Recursion/problem

Day 9 Recursion 3 Solution in Cpp

#include <iostream>
#include <cmath>
#include <cstdio>
#include <vector>
#include <algorithm>
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)));
    }
}