Last active
April 26, 2017 17:04
-
-
Save brettinternet/68d6f4bbe85d6e62d0e41bd16b9d5cb6 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
let fibonacci = (n) => { | |
if(n <= 2) { | |
return 1; | |
} else { | |
return fibonacci(n - 1) + fibonacci(n - 2); | |
} | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
While recursion is a viable solution, a
while loop
is more optimal.source