• 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)
=100+99+sum(98)
=100+99+…+sum(1)
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)
return(1);
else
s=n+sum(n-1);
return(s);
}
• 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)
=100+99+sum(98)
=100+99+…+sum(1)
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)
return(1);
else
s=n+sum(n-1);
return(s);
}
well understanding,thx
ReplyDelete