Factorial in Recursion Memory in C++

 #include <iostream>

using namespace std;

// factorial

int factorial(int n) {

    if(n==0) { // base case - where solution is known (smallest problem)

        return 1;

    }

    return n * factorial(n-1);  // 6 * 5 * 4!

}

int main() {

    int ans = factorial(4); // initialize the answer

    cout << ans << endl; // display result

    return 0;

}