fibonacci series in java using recursion
class FibonacciExample2{ static int n1=0,n2=1,n3=0; static void printFibonacci(int count){ if(count>0){ n3 = n1 + n2; n1 = n2; n2 = n3; System.out.print(" "+n3); printFibonacci(count-1); } } public static void main(String args[]){ int count=10; System.out.print(n1+" "+n2);//printing 0 and 1 printFibonacci(count-2);//n-2 because 2 numbers are already printed } } 0 1 1 2 3 5 8 13 21 34
Source: www.javatpoint.com
fibonacci sequence in java recursion
//Using Recursion public class FibonacciCalc{ public static int fibonacciRecursion(int n){ if(n == 0){ return 0; } if(n == 1 || n == 2){ return 1; } return fibonacciRecursion(n-2) + fibonacciRecursion(n-1); } public static void main(String args[]) { int maxNumber = 10; System.out.print("Fibonacci Series of "+maxNumber+" numbers: "); for(int i = 0; i < maxNumber; i++){ System.out.print(fibonacciRecursion(i) +" "); } } }
Source: www.guru99.com
recursion java fibonacci
Fn = Fn-1 + Fn-2
Source: www.geeksforgeeks.org