fibonacci sequence without recursion code example
Example 1: fibonacci sequence without recursion
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
public class FibonacciSeriesWithoutRecursion {
public static void main(String args[]) {
fibonacci(10);
}
public static void fibonacci(int number){
for(int i=0; i <= number; i++){
System.out.print(getFibonacci(i) + " ");
}
}
public static int getFibonacci(int n){
if (n == 0) {
return 0;
}
if (n == 1){
return 1;
}
int first = 0;
int second = 1;
int nth = 1;
for (int i = 2; i <= n; i++) {
nth = first + second;
first = second;
second = nth;
}
return nth;
}
}
Output : 0 1 1 2 3 5 8 13 21 34 55
Example 2: fibonacci sequence single recursive call
int fibonacci(int i, int sum1, int sum2)
{
if(i == 1) {
return sum2;
}
return fibonacci(i - 1, sum2, sum1 + sum2);
}