C Recursion
Recursion is the process of repeating items in a
self-similar way.
In
programming languages, if a program allows calling a function inside the same
function, then it is called a recursive call of the function.
void recursion()
{
recursion (); /* function calls
itself */
}
int main()
{
recursion();
}
The C
programming language supports recursion, i.e., a function to call itself. But
while using recursion, programmers need to be careful to define an exit
condition from the function.
Recursive
functions are very useful to solve many mathematical problems, such as
calculating the factorial of a number, generating Fibonacci series, etc.
The
recursion continues until some condition is met to prevent it.
To prevent infinite recursion, if...else statement (or similar
approach) can be used where one branch makes the recursive call, and other
doesn't.
It is frequently used in data structure
and algorithms. For example, it is common to use recursion in problems
#include <stdio.h>
int factorial( int i)
{
if(i <= 1)
{
return 1;
}
return i * factorial(i - 1);
}
int main()
{
int i = 12;
printf("Factorial of %d is %d\n", i, factorial(i));
return 0;
}
Milan Tomic
Hi. I’m Designer of Blog Magic. I’m CEO/Founder of ThemeXpose. I’m Creative Art Director, Web Designer, UI/UX Designer, Interaction Designer, Industrial Designer, Web Developer, Business Enthusiast, StartUp Enthusiast, Speaker, Writer and Photographer. Inspired to make things looks better.
0 comments:
Post a Comment