Scribd
Upload
36 views

C - Recursion: Number Factorial

Recursive function are very useful to solve many mathematical problems like to calculate factorial of a number, g enerating Fibonacci series, etc. But while using recursion, prog rammers need to be careful to define an exit condition from the function, otherwise it will g o in infinite loop.

Uploaded by

AnantKhatavkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

C - Recursion: Number Factorial

Recursive function are very useful to solve many mathematical problems like to calculate factorial of a number, g enerating Fibonacci series, etc. But while using recursion, prog rammers need to be careful to define an exit condition from the function, otherwise it will g o in infinite loop.

Uploaded by

AnantKhatavkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

C - RECURSION

http://www.tuto rialspo int.co m/cpro g ramming /c_re cursio n.htm

Co pyrig ht tuto rials po int.co m

Recursion is the process of repeating items in a self-similar way. Same applies in prog ramming lang uag es as
well where if a prog ramming allows you to call a function inside the same function that is called recursive call of the
function as follows.
void recursion()
{
recursion(); /* function calls itself */
}
int main()
{
recursion();
}

T he C prog ramming lang uag e supports recursion, i.e., a function to call itself. But while using recursion,
prog rammers need to be careful to define an exit condition from the function, otherwise it will g o in infinite loop.
Recursive function are very useful to solve many mathematical problems like to calculate factorial of a number,
g enerating Fibonacci series, etc.

Number Factorial
Following is an example, which calculates factorial for a g iven number using a recursive function:
#include <stdio.h>
int factorial(unsigned int i)
{
if(i <= 1)
{
return 1;
}
return i * factorial(i - 1);
}
int main()
{
int i = 15;
printf("Factorial of %d is %d\n", i, factorial(i));
return 0;
}

When the above code is compiled and executed, it produces the following result:
Factorial of 15 is 2004310016

Fibonacci Series
Following is another example, which g enerates Fibonacci series for a g iven number using a recursive function:
#include <stdio.h>
int fibonaci(int i)
{
if(i == 0)
{
return 0;
}
if(i == 1)
{
return 1;
}
return fibonaci(i-1) + fibonaci(i-2);

return fibonaci(i-1) + fibonaci(i-2);


}
int
{

main()
int i;
for (i = 0; i < 10; i++)
{
printf("%d\t%n", fibonaci(i));
}
return 0;

When the above code is compiled and executed, it produces the following result:
0 1 1 2 3 5 8 13 21 34

You might also like