Breaking News: Grepper is joining You.com. Read the official announcement!

Function to compute factorial recursively

Add Answer

John Adex answered on July 12, 2020 Popularity 5/10 Helpfulness 2/10

answer Function to compute factorial recursively

related Factorial of a number using recursion

related recursive factorial

related factorial recursive

related recursive factorial of a number

related recursion factorial algorithm

related complexity analysis of factorial using recursion

related factorial recursion

related Recursive function of factorial

related factorial using recursion

Function to compute factorial recursively

Comment

// Function to compute factorial recursively
const factorial = (n) => {
    if (isNaN(n)) {
        return 1;
    }

    if (n === 0 || n === 1) {
        return 1;
    } else {
        return n * factorial(n - 1);
    }
};

// Extract the first argument from the command line and cast it as an integer
const inputNumber = parseInt(process.argv[2]);

// Compute the factorial and print the result
console.log(`Factorial of ${inputNumber}: ${factorial(inputNumber)}`);

Popularity 5/10 Helpfulness 2/10 Language javascript

Source: chat.openai.com

Tags: factorial function javascript

Link to this answer
Share Copy Link

Contributed on Dec 12 2023

John Adex

0 Answers Avg Quality 2/10

Closely Related Answers

Factorial of a number using recursion

Comment

#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);
}

Popularity 10/10 Helpfulness 4/10 Language whatever

Source: stackoverflow.com

Tags: factorial fact

Link to this answer
Share Copy Link

Contributed on Jun 20 2021

Mr Void

0 Answers Avg Quality 2/10

recursive factorial

Comment

1def factorial(n):
2    if n <= 1: # BASE CASE
3        return 1
4    return n * factorial(n - 1) # RECURSIVE CALL

Popularity 9/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: factorial fact

Link to this answer
Share Copy Link

Contributed on Jun 07 2023

Levi McDonough

0 Answers Avg Quality 2/10

factorial recursive

Comment

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))

Popularity 9/10 Helpfulness 4/10 Language whatever

Source: Grepper

Tags: factorial fact

Link to this answer
Share Copy Link

Contributed on Jun 26 2021

kirito.

0 Answers Avg Quality 2/10

recursive factorial of a number

Comment

factorial(N){
    if(N<=1)
    {
      return 1;
    }
    else
    {
      return (N*factorial(N-1));
    }
}

Popularity 9/10 Helpfulness 4/10 Language cpp

Source: www.scaler.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jan 11 2022

Booby Boober

0 Answers Avg Quality 2/10

recursion factorial algorithm

Comment

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 *)

Popularity 10/10 Helpfulness 3/10 Language whatever

Source: planetmath.org

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Dec 29 2020

Dev Inca

0 Answers Avg Quality 2/10

complexity analysis of factorial using recursion

Comment

T(n) = T(n-1) + 3   (3 is for As we have to do three constant operations like 
                 multiplication,subtraction and checking the value of n in each recursive 
                 call)

     = T(n-2) + 6  (Second recursive call)
     = T(n-3) + 9  (Third recursive call)
     .
     .
     .
     .
     = T(n-k) + 3k
     till, k = n

     Then,

     = T(n-n) + 3n
     = T(0) + 3n
     = 1 + 3n

Popularity 9/10 Helpfulness 3/10 Language whatever

Source: stackoverflow.com

Tags: analysis analysi

Link to this answer
Share Copy Link

Contributed on Jul 12 2020

Anxious Antelope

0 Answers Avg Quality 2/10

factorial recursion

Comment

function factorial(n) {
  // Base case
  if (n === 0 || n === 1) return 1;
  // Recursive case
  return n * factorial(n — 1);
}

Popularity 9/10 Helpfulness 2/10 Language javascript

Source: medium.com

Tags: factorial fact

Link to this answer
Share Copy Link

Contributed on Oct 27 2021

Quaint Quoll

0 Answers Avg Quality 2/10

Recursive function of factorial

Comment

# Factorial of a number using recursion 
def recur_factorial(n): 
 if n == 1: 
    return n 
 else: 
      return n*recur_factorial(n-1) 
num = 6 
# 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))

Popularity 9/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: factorial fact

Link to this answer
Share Copy Link

Contributed on Jun 23 2022

Sunshine

0 Answers Avg Quality 2/10

factorial using recursion

Comment

def fact(n):
  if n==0 or n==1:
    return 1
  else:
    return n*fact(n-1)
print(fact(4))
print(fact(3))
print(fact(0))

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: factorial fact

Link to this answer
Share Copy Link

Contributed on Jan 25 2022

Crowded Cassowary

0 Answers Avg Quality 2/10

Function to compute factorial recursively

Contents

More Related Answers

Function to compute factorial recursively

Closely Related Answers

Factorial of a number using recursion

recursive factorial

factorial recursive

recursive factorial of a number

recursion factorial algorithm

complexity analysis of factorial using recursion

factorial recursion

Recursive function of factorial

factorial using recursion

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.