Solving Fibonacci: Recursion

Fibonacci!
function fib(n) {

if (n < 2) {
return n
}
return fib(n-1) + fib(n-2) }
Here is a nice diagram of how the recursive calls work!

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store