재귀식을 이용한 피보나치 수열

let result;

function recursive(number) {
  if(number == 1 || number == 0) {
    return number;
  }
  // f(n) = f(n - 1) + f(n - 2)
  return recursive(number - 1) + recursive(number - 2);
}

result = recursive(5);
console.log(result);

풀이

f(5) = f(4) + f(3) => 2 + 3

f(4) = f(3) + f(2) => 2 + 1

f(3) = f(2) + f(1) => 1 + 1

f(2) = f(1) + f(0) => 1 + 0

f(1) = 1

f(0) = 0