Code to find factorial using function recursion

• Define a function that takes an integer as input

• Check if the input is 0 or 1, return 1 in that case

• Otherwise, call the function recursively with input-1 ...read more

//best solution

size_t factorial(size_t _num)

{

size_t res= 1,int i = 1;

for(; i < n ; ++i)

{

res*=i;

}

return res;

}

size_t ReqFactorial(size_t _num)

{

if(1 == _num)

return 1;

return _num * ...read more