Alexander Larson alexanderlarson
alexanderlarson
/ Fibrec
Created
August 16, 2013 04:10
Recursive (slow) solution to Fibonacci validation exercise
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
| def fibonacci(n) | |
| if n <= 1 | |
| n | |
| else | |
| fibonacci(n-1) + fibonacci(n-2) | |
| end | |
| end | |
| def isFibonacci(soughtNumber) | |
| return isFibonacci?(soughtNumber, 1) |
NewerOlder