Lecture 18

Question 1

Fibonacci using recursion code

Answer 1

int fibonacci(int n) {
     if(n == 0 || n == 1) {
          return 1;
     } else {
          return fibonacci(n-2) + fibonacci(n-1);
     }
}