Recursion: definition and example in C

• A user – defined function, which calls itself, is called a recursive function and the process is called recursion.
• In many programming situations, we required to execute same function several times.
• A function is called recursive, if
A. There exit some base criterion for which function will not call itself but will return some constant. And
B. In every recursive call, the argument must tent to base criterion.
• For example,
To calculate sum of number 1…100
Sum(100) =100+sum(99)
Here the function sum()is the recursive function.
While calculating sum(100), we are calling function sum(99)
In C programming the function is implemented as
int sum (int n)
int s:
if (n==1)

Related Links :

1 comment:

If you face any Problem in viewing code such as Incomplete "For Loops" or "Incorrect greater than or smaller" than equal to signs then please collect from My Web Site CLICK HERE

More Useful Topics...


History Of C..

In the beginning was Charles Babbage and his Analytical Engine, a machine
he built in 1822 that could be programmed to carry out different computations.
Move forward more than 100 years, where the U.S. government in
1942 used concepts from Babbage’s engine to create the ENIAC, the first
modern computer.
Meanwhile, over at the AT&T Bell Labs, in 1972 Dennis Ritchie was working
with two languages: B (for Bell) and BCPL (Basic Combined Programming
Language). Inspired by Pascal, Mr. Ritchie developed the C programming

My 1st Program...

void main ()
clrscr ();
printf ("\n\n\n\n");
printf ("\t\t\t*******Pankaj *******\n");
printf ("\t\t\t********************************\n");
printf ("\t\t\t\"Life is Good...\"\n");
printf ("\t\t\t********************************");
getch ();

Next Step...


void main ()
clrscr ();
printf ("\n\n\n\n\n\n\n\n");
printf ("\t\t\t --------------------------- \n\n");

printf ("\t\t\t | IGCT, Info Computers, INDIA | \n\n");
printf ("\t\t\t --------------------------- ");

getch ();