Skip to content

Instantly share code, notes, and snippets.

@Nata01
Created December 15, 2015 13:23
Show Gist options
  • Save Nata01/a04fef355a6d015ccb6a to your computer and use it in GitHub Desktop.
Save Nata01/a04fef355a6d015ccb6a to your computer and use it in GitHub Desktop.
Fibonacci numbers. Recursive solution.
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