Java problem

/**

* PROBLEM 5:

The implementation of terribleFibonacci is TERRIBLE! Rewrite a

* more efficient version of fibonacci which computes each fibonacci number(use recursive)

* between 0 and n at most once.

*/

public static void runTerrible () {

for (int N = 0; N < 100; N++)

StdOut.printf ("terribleFibonacci(%2d)=%d ", N, terribleFibonacci (N));

}

public static long terribleFibonacci (int n) {

if (n == 0) return 0;

if (n == 1) return 1;

return terribleFibonacci (n - 1) + terribleFibonacci (n - 2);

}