Question

How to print the first N fibonacci numbers using recursion in Java

Answer 1

public class PrintTheFirstNFibonacciNumbersUsingRecursion_Java {
    static int n1 = 0, n2 = 1, n3 = 0;    
 
     static void printFibonacci(int N) {    
        if (N > 0) {    
            n3 = n1 + n2;    
            n1 = n2;    
            n2 = n3;    
            System.out.print(" " + n3);   
            printFibonacci(N - 1);    
        }    
     }    
    public static void main(String args[]) {
        int N = 10;    
         
        System.out.print(n1 + " " + n2);
         
        printFibonacci(N - 2);
    }
}

 
 
/*
run:
 
0 1 1 2 3 5 8 13 21 34
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

public class MyClass {
     static int n1 = 0, n2 = 1, n3 = 0;    
     
     static void printFibonacci(int N) {  
        if (n1 == 0 && n2 == 1) {
            System.out.print(n1 + " " + n2);
            N = N - 2; 
        }
        if (N > 0) {    
            n3 = n1 + n2;    
            n1 = n2;    
            n2 = n3;    
            System.out.print(" " + n3);   
            printFibonacci(N - 1);    
        }    
     }    
    public static void main(String args[]) {
        int N = 10;    
        
        printFibonacci(N);
    }
}



/*
run:

0 1 1 2 3 5 8 13 21 34

*/

 

70+ SQL courses for beginners and professionals

Answer 3

public class PrintTheFirstNFibonacciNumbersUsingRecursion_Java {
    static int getFibonacci(int num) {  
        if (num < 2) {
            return num;
        }
        else {
            return getFibonacci(num - 1) + getFibonacci(num - 2);
        }
    }
    public static void main(String args[]) {
        int N = 10;    
        
        for (int i = 0; i < N; i++) {
            System.out.print(getFibonacci(i) + " ");
        }
    }
}


/*
run:
 
0 1 1 2 3 5 8 13 21 34
 
*/

 

70+ SQL courses for beginners and professionals

Answer 4

public class PrintTheFirstNFibonacciNumbersUsingRecursion_Java {
    static int getFibonacci(int num) {  
        if (num < 2) {
            return num;
        }
        else {
            return getFibonacci(num - 1) + getFibonacci(num - 2);
        }
    }
    static void Fibonacci(int N) {  
        for (int i = 0; i < N; i++) {
            System.out.print(getFibonacci(i) + " ");
        }
    }
    public static void main(String args[]) {
        int N = 10;    

        Fibonacci(N);
    }
}


/*
run:
 
0 1 1 2 3 5 8 13 21 34
 
*/

 

70+ SQL courses for beginners and professionals