Cse 11-1
Cse 11-1
Recursion
Recursion
A function that calls itself is known as a recursive function. And, this
technique is known as recursion.
Example: Sum of natural numbers
Use recursion to calculate the sum of natural numbers
Example: if n = 8,
Sum = 1+2+3+4+5+6+7+8
Example: Sum of natural numbers
#include<stdio.h> Explanation of this code is give here.
Google Drive Link
int sum(int x)
{
if(x>0)
return x+sum(x-1); Recursive function
else
return 0;
}
int main()
{
int n = 5;
int s = sum(n);
printf("sum of natural numbers=%d",s);
}
Example: Factorial using recursion
#include<stdio.h>
int factorial(int x)
{
if(x>0)
return x*factorial(x-1); Recursive function
else
return 1;
}
int main()
{
int n = 5;
int f = factorial(n);
printf("factorial of %d = %d\n",n,f);
}
Print odd numbers between an interval
Example:
input: n = 4, m = 11
output: 5, 7, 9, 11
int main()
{
func(3);
}