public static int f(int a){
if(a==0) return 0;
if(a==1) return 1;
return (f(a-1) + f(a-2));
}
Is there a non-recursive way of doing this?
Asked
Active
Viewed 69 times
1
Subhrajyoti Majumder
- 39,719
- 12
- 74
- 101
user2272963
- 11
- 1
-
yes you can, Using loop. – Subhrajyoti Majumder Apr 12 '13 at 05:00
-
In short: yes. Question: What approaches have you taken to solve it non-recursively? – Makoto Apr 12 '13 at 05:00
-
1With `a < 0` this recursion becomes infinite. – PM 77-1 Apr 12 '13 at 05:05