/**********************************************************************
 * Author:        Eric Heim
 * Date Created:  7/19/2011
 * Course:        CS0007
 * Description:   Shows the use of recursion to create a method that
 *                returns the ith fibonacci number
 **********************************************************************/

public class Fibonacci {
	public static void main(String[] args) {

		System.out.println("The first 10 fibonacci numbers are: ");
		for(int i = 0; i < 10; i++) {
			System.out.print(fibonacciNumber(i) + " ");
		}
		System.out.println();
	}
	
	public static int fibonacciNumber(int number){
		if(number == 0)
			return 0;
		else if(number == 1) 
			return 1;
		else
			return fibonacciNumber(number-1) + fibonacciNumber(number-2);
	}
}