Created
December 15, 2015 13:23
-
-
Save Nata01/a04fef355a6d015ccb6a to your computer and use it in GitHub Desktop.
Fibonacci numbers. Recursive solution.
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
int fib2(int n){ | |
if(n == 0) | |
return 0; | |
if(n == 1 || n == 2) | |
return 1; | |
return fib2(n-2) + fib2(n-1); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment