Answers for "factorial using recursion"

C++
3

find factoril in C using recursion

#include<stdio.h>
fact(int i, int k){
    k=k*i;
    i--;
    if(i==0){
        return k;
    }
    else{
        fact(i, k);
    }
}
int main()
{
    int k = 1, i, factorial;
    scanf("%d",&i);
    factorial = fact(i, k);
    printf("%d\n",factorial);
    return 0;
}
Posted by: Guest on January-31-2021
8

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
Posted by: Guest on July-09-2020
1

factorial of number using recursion

//using recursion to find factorial of a number

#include<stdio.h>

int fact(int n);

int main()
{
    int n;
    printf("Enter the number: ");
    scanf("%d",&n);

    printf("Factorial of %d = %d", n, fact(n));

}

int fact(int n)

{
    if (n>=1)
        return n*fact(n-1);
    else
        return 1;
}
Posted by: Guest on June-26-2021
2

recursion factorial algorithm

FUNCTION FACTORIAL (N: INTEGER): INTEGER
(* RECURSIVE COMPUTATION OF N FACTORIAL *)

BEGIN
  (* TEST FOR STOPPING STATE *)
  IF N <= 0 THEN
    FACTORIAL := 1
  ELSE
    FACTORIAL := N * FACTORIAL(N - 1)
END; (* FACTORIAL *)
Posted by: Guest on December-29-2020
0

Factorial of a number using recursion

#include <stdio.h>
int factorial(int number){
    if(number==1){
        return number;
    }
    return number*factorial(number - 1);
}
int main(){
    int a=factorial(5);
    printf("%d",a);
}
Posted by: Guest on June-20-2021
0

factorial recursive

N= int(input())
def fun(n):
    if n ==1 or n==0:
        return 1
    else:
        n = n * fun(n-1)
        return n 


print(fun(N))
Posted by: Guest on June-26-2021

Code answers related to "factorial using recursion"

Browse Popular Code Answers by Language