"Fibonacci Calculator & Fibonacci Test"
09-30-10

/*
Fig 15.5
9/18/07
*/
public class FibonacciCalculator
{
//recursive declaration of method Fibonacci
public long fibonacci( long number )
{
if (( number == 0 ) || (number == 1 )) //base cases
return number;
else //recursion step
return fibonacci( number - 1) + fibonacci( number - 2 );
}
public void displayFibonacci()
{
for (int counter = 0; counter <= 10; counter++)
System.out.printf( "Fibonacci of %d is %d\n", counter, fibonacci( counter ) );
}
}
~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|~|
/*
Fig 15.6
9/18/07
*/
public class FibonacciTest
{
public static void main( String args[] )
{
FibonacciCalculator fibonacciCalculator = new FibonacciCalculator();
fibonacciCalculator.displayFibonacci();
}
}
No comments:
Post a Comment