Day 9: Recursion 3

 Problem

Objective
Today, we are learning about an algorithmic concept called recursion. Check out the Tutorial tab for learning materials and an instructional video.

Recursive Method for Calculating Factorial

Function Description
Complete the factorial function in the editor below. Be sure to use recursion.

factorial has the following paramter:

• int n: an integer

Returns

• int: the factorial of 

Note: If you fail to use recursion or fail to name your recursive function factorial or Factorial, you will get a score of .

Input Format

A single integer,  (the argument to pass to factorial).

Constraints

• Your submission must contain a recursive function named factorial.

Sample Input

3

Sample Output

6

Explanation

Consider the following steps. After the recursive calls from step 1 to 3, results are accumulated from step 3 to 1.

Here's my Code in C++

#include <bits/stdc++.h>

using namespace std;

// Complete the factorial function below.

int factorial(int n) {

    int hasil;

    if (n != 1){

        hasil = n * factorial(n - 1);

    } else {

        hasil = 1;

    }

    return hasil;

}

int main()

{

    

    int n;

    cin >> n;

    cin.ignore(numeric_limits<streamsize>::max(), '\n');

    int result = factorial(n);

    cout << result << "\n";

    

    return 0;

}