Answers for "factorial of a number in c++ using recursion"

factorial in c++

#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;

int fact(int i){
	if (i <= 1) return 1;
  	else return i*fact(i-1);
}

int main(){
  	ios::sync_with_stdio(0);
  	cin.tie(0);
  	int N;
  	cin >> N;
  	cout << fact(N) << "\n";
  	return 0;
}

factorial using recursion in c++

#include <iostream>
using namespace std;

int factorial(int n)
{
    if (n < 0)
        return (-1); /*Wrong value*/
    if (n == 0)
        return (1); /*Wrong value*/
    else
    {
      return (n * factorial(n - 1));
    }
}

int main()
{
    int number, ans;
    cin >> number;
    ans = factorial(number);
    cout << ans;
    return 0;
}

c++ factorial

#include <cmath>

int fact(int n){
    return std::tgamma(n + 1);  
}    
// for n = 5 -> 5 * 4 * 3 * 2 = 120 
//tgamma performas factorial with n - 1 -> hence we use n + 1