数据结构_递归

//递归
  
  //阶乘
  function factorial (n) {
    if (n == 0) return 1
    return n * factorial(n - 1)
  }

  //斐波那契数列
  function fibonacci (n) {
    if (n == 1 || n == 2) return 1
    return fibonacci(n - 1) + fibonacci(n - 2)
  }