Answers for "Factorial of a number using recursion"

8

factorial of a number using recursion in python

# Factorial of a number using recursion

def recur_factorial(n):
   if n == 1:
       return n
   else:
       return n*recur_factorial(n-1)

num = 7

# check if the number is negative
if num < 0:
   print("Sorry, factorial does not exist for negative numbers")
elif num == 0:
   print("The factorial of 0 is 1")
else:
   print("The factorial of", num, "is", recur_factorial(num))
Posted by: Guest on June-13-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 of a number Using Recursion

// Factorial of n = 1*2*3*...*n

#include <iostream>
using namespace std;

int factorial(int);

int main() {
    int n, result;

    cout << "Enter a non-negative number: ";
    cin >> n;

    result = factorial(n);
    cout << "Factorial of " << n << " = " << result;
    return 0;
}

int factorial(int n) {
    if (n > 1) {
        return n * factorial(n - 1);
    } else {
        return 1;
    }
}
Posted by: Guest on August-26-2021

Code answers related to "Factorial of a number using recursion"

Browse Popular Code Answers by Language