Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,879 questions

51,805 answers

573 users

How to print the fibonacci sequence recursively and with for loop in Java

3 Answers

0 votes
package javaapplication1;
 
public class Example {
     
    public static void main(String[] args) {
                
        // for loop 1: series of 15 fibonacci numbers (n = 15)
        int prev = -1, next = 1, sum, n = 15;
  
        for (int i = 0; i <= n; i++)
        {
            sum = prev + next;
            System.out.print("  " + sum);
            prev = next;
            next = sum;
        }
    }
}
    
    
/*
run:
 
0  1  1  2  3  5  8  13  21  34  55  89  144  233  377  610
     
*/

 



answered Feb 26, 2016 by avibootz
0 votes
package javaapplication1;
 
public class Example {
     
    public static void main(String[] args) {
                
       // recursively: series of 15 fibonacci numbers (n = 15)
        int n = 15;
 
        for (int i = 0; i <= n; i++)
            System.out.print("  " +  Fibonacci(i));
    }
    public static int Fibonacci(int n)
    {
        if (n == 0)
            return 0;
        else if (n == 1)
                 return 1;
             else
             {
                 return Fibonacci(n - 2) + Fibonacci(n - 1);
             }
    }
}
    
    
/*
run:
 
0  1  1  2  3  5  8  13  21  34  55  89  144  233  377  610
     
*/

 



answered Feb 26, 2016 by avibootz
0 votes
package javaapplication1;
 
public class Example {
     
    public static void main(String[] args) {
                
       // recursively: series of 15 fibonacci numbers (n = 15)
        int n = 15;
 
        for (int i = 0; i <= n; i++)
            System.out.print("  " +  Fibonacci(i));
    }
    public static int Fibonacci(int n)
    {
        switch (n) {
            case 0:
                return 0;
            case 1:
                return 1;
            default:
                return Fibonacci(n - 2) + Fibonacci(n - 1);
        }
    }
}
    
    
/*
run:
 
0  1  1  2  3  5  8  13  21  34  55  89  144  233  377  610
     
*/

 



answered Feb 26, 2016 by avibootz
...