Source of FibonacciRecursive.java

Structures and functions

public class FibonacciRecursive

  1: //FibonacciRecursive.java
  2: 
  3: public class FibonacciRecursive
  4: {
  5:     public static void main(String[] args)
  6:     {
  7:         long n = Long.parseLong(args[0]);
  8:         long i;
  9:         for (i = 1; i <= n; i++)
 10:         {
 11:             System.out.printf("%19d", fibRecursive(i));
 12:             if (i % 4 == 0)
 13:             {
 14:                 System.out.println();
 15:             }
 16:         }
 17:         if ((i - 1) % 4 != 0)
 18:         {
 19:             System.out.println();
 20:         }
 21:     }
 22: 
 23:     //Computes and returns the nth Fibonacci number,
 24:     //using a recursive algorithm
 25:     private static long fibRecursive(long n)
 26:     {
 27:         if (n <= 2)
 28:         {
 29:             return 1;
 30:         }
 31:         else
 32:         {
 33:             return fibRecursive(n - 2) + fibRecursive(n - 1);
 34:         }
 35:     }
 36: }