Recursion is a programming technique in which a method calls itself, i.e a method is defined in terms of itself.
In recursion a function α calls itself directly or calls a function β that in turn calls the original function α The function α is called a recursive function.
Following are the code and implementation of some examples of recursion
int sum(int n){
int sumOfNums;
if(n == 1){
sumOfNums = 1;
}
else{
sumOfNums = n + sum(n - 1)
}
return sumOfNums
}
Enter n:
Sum of first n nums:
int factorial(int n){
if(n == 1){
return n;
}
else{
return n*factorial(n-1);
}
}
Enter N:
N! =
int fibonacci(int n){
if(n ≤ 1){
return 1;
}
else{
return fibonacci(n - 1) + fibonacci(n - 2);
}
}
Enter N:
Nth fibonacci number =