compute factorial using recursive in C++

Factorial.cpp

// A simple recursive function has two main parts: the base-case part, where it computes a vaue and terminates,
// and the recursive part, where it calls itself.


#include <iostream>


//Recursive factorial function
//
//#include<iostream>

using namespace std;

//Recursive factorial function
//
long factorial (int n)
{
	if (n<=1)
		return 1;
	else
		return n*factorial(n-1);
}

int main()
{
	int i = 3;
	cout << "\n Factorial of 3 is " << factorial(i) << endl;
}