marclundgren
11/20/2016 - 11:28 PM

fibonacci algorithms (recursive and iterative)

fibonacci algorithms (recursive and iterative)

function fibRecursive(num) {
  if (num === 0) {
    return 0
  }
  if (num === 1 || num === 2) {
    return 1
  }

  return fibRecursive(num - 1) + fibRecursive(num - 2)
}
function fib(num) {
  if (num === 0) {
    return 0
  }

  if (num === 1 || num === 2) {
    return 1
  }

  let a = 1
  let b = 1

  for (let index = 3; index < num; index++) {
    [a,b] = [a + b, a]
  }

  return a + b
}