CS2
Recursion
10
Be careful
npublic int fibonacci(int n) {
nif (n == 0 || n == 1) {
nreturn 1;
n}
nelse {
nreturn fibonacci(n-1)+fibonacci(n-2);
n}
n}
n• This looks fine, but in fact is disastrously
nslow because it unnecessarily repeats some
ncalculations over and over again!