What is Recursion??
Recursion is name for function that call themselves.
Actually, Function can call themselves. When they call themselves, they are recursive, that is why it called recursion.
Recursion can be use for looping too.
There is many thing that can use recursion, for example, factorial or fibonacci ,etc.
This is code for factorial~~
#include<stdio.h>
int factorial(int n){
if(n==0||n==1)
return 1;
else
return n*factorial(n-1);}
int main(){
int a;
scanf("%d",&a);
int b=factorial(a);
printf("%d",b);
}
And this for fibonacci
#include<stdio.h>
int fibonacci(int n){
if(n==0||n==1)
return 1;
else
return fibonacci(n-1)+fibonacci(n-2);
}
int main(){
int a;
scanf("%d",&a);
int b=fibonacci(a);
printf("%d",b);
}
So the conclusion is Recursion is function that call themselves~~~ =w=
No comments:
Post a Comment