Algo JS Snippets

Fibonacci Recursive

assume sequence starts with 1. Example of BAD Recursive fn. Traverse down Fibonacci Tree until reach 1

function fibonacci(index: number) { 
  if(index <= 1) return 1
  return fibonacci(index-1) + fibonacci(index-2)
}

References