Im about writing a program input number, implemented it with apply this formular: n!/(n/2)!, using recursive function. Question is: How would I be able to find the largest number of n without overflowing, which number is too big for the computer handle?
So far, I just had this program to calculate n!/(n/2)!
int GetVal(int n);
printf("Result found: %c", GetVal(n)/GetVal(n/2);
int GetVal(int n)
if (n == 1)
return n * GetVal(n - 1);
Any help would be highly appreciate!