Calculate fabonaci(Recursive& Iterative way)
Page 1 of 1
Calculate fabonaci(Recursive& Iterative way)
Iterative way:
public int fabonaci(int n){
if(n<=0)
return 0;
int previous=-1;
int current=1;
for(int i=0;i<=n;i++){
int sum=previous+current;
previous=current;
current=sum;
}
return sum;
}
Recursive way:
public int fabonaci(int n){
if(n<=0)
return 0;
if(n==1)
return 1;
return fabonaci(n-1)+fabonaci(n-2);
}
public int fabonaci(int n){
if(n<=0)
return 0;
int previous=-1;
int current=1;
for(int i=0;i<=n;i++){
int sum=previous+current;
previous=current;
current=sum;
}
return sum;
}
Recursive way:
public int fabonaci(int n){
if(n<=0)
return 0;
if(n==1)
return 1;
return fabonaci(n-1)+fabonaci(n-2);
}
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|