Thread: Recursive function outputs the wrong value at higher numbers?!

OK so I made this recursive function for getting the factorial of a number. Problem is, It only prints out the right answer for inputs up to 12. I can't get it to output the right answer for inputs that are higher than 12.

Code:

int factorial(int input
{

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

integer has limited size(usually 4 bytes). It cannot hold all values...

Originally Posted by Bayint Naung

integer has limited size(usually 4 bytes). It cannot hold all values...

Yep... just checked it... an input of 13 overflows a 32 bit integer.

Thanks.

Originally Posted by TheWhiffet

Thanks.

So... you're not at all curious how to check this for yourself?

There are various solutions to implement to extend the function so that it can utilize higher numbers,

how do you think your issue can be fixed in your own words? How do you think the operations can happen in a manner is not held by the bound of a single integer?

Curiosity is an amazing learning tool for programming, that it is.