// Fibonacci sequence
//   Number in series interactively or via command line argument
//
//  Usage:
//   javac fibonacciRecursive.java
//   java fibonacciRecursive [optionalNumberInSequence]

import java.util.Scanner;

public class fibonacciRecursive {

 public static void main(String [] args) {
  int nsize = 0, fibonacci, i;
  
  // Check for argument 1 number in series
  if (args.length > 0) {
    for(i=0; i<args[0].toString().length(); i++) {
       if (args[0].substring(i,1).compareTo("0") >= 0 && 
           args[0].substring(i,1).compareTo("9") <= 0) {
         nsize = nsize;
       } else if (!args[0].substring(i,1).equals("-")) {
         nsize--;
       }
    }
    if (nsize == 0) nsize = Integer.parseInt(args[0]);
  } 
  if (nsize <= 0) {  
    Scanner inputscanner = new Scanner(System.in);
    System.out.print("How many numbers are there in your fibonacci sequence: ");
    nsize = inputscanner.nextInt();
  }

  for(i=0; i<=nsize; i++) {
    fibonacci = countFibonacci(i);
    System.out.print(fibonacci + " ");
  }
  System.out.println("");
 }

 public static int countFibonacci(int i) {  // Recursive function
  int fibonacci;
  if (i == 0) return 0;
  if (i == 1) return 1;

  fibonacci = countFibonacci(i-1) + countFibonacci(i-2);
  return fibonacci;
 }
}