Answers for "factorial recursion"

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 recursion

function factorial(n) {
  // Base case
  if (n === 0 || n === 1) return 1;
  // Recursive case
  return n * factorial(n — 1);
}
Posted by: Guest on October-27-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

Browse Popular Code Answers by Language