[ASK] Recursion Find Smallest Factorial

Programming Questions

n0talentg..

[ASK] Recursion Find Smallest Factorial

in Programming Questions • 1 year ago

I have made program that can find biggest factorial from number using recursion and also a program that can find smallest factorial but not using recursion.

But I used to have a program that find the smallest factorial using recursion. Anyone here know how to do it?

Thank you.

Replies(3)

hellochar

Re: [ASK] Recursion Find Smallest Factor

1 year ago

Do you mean "factor" when you say factorial? The two are very different things. Even so I don't understand what you're asking. The smallest factor of a number will always be 1.

n0talentg..

Re: Re: [ASK] Recursion Find Smallest Factor

1 year ago

I am sorry my bad, it is factorial... ;)

tfguy44

Re: [ASK] Recursion Find Smallest Factorial

1 year ago

It makes no sense to talk about the biggest or smallest factorial of a number.

The factorial of a number is the product that number and the factorial of one less than that number, with the factorial of 0 being 1.

Thus:

0! = 1

1! = 1 * 0! = 1 * 1 = 1

2! = 2 * 1! = 2 * 1 * 0! = 2 * 1 * 1 = 2

3! = 3 * 2! = 3 * 2 * 1! = 3 * 2 * 1 * 0! = 3 * 2 * 1 * 1 = 6

And so on...

This leads to the obviously recursive way to write a factorial function:

int factorial( unsigned int n ){
if( n == 0 ){ return( 1 ); }
return( n * factorial( n - 1 ) );
}

Top Reply