Fibonacci Sequence - Ruby One-Liners #225
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Please describe your program and how to run it.
This PR adds two Ruby scripts to print out the n-th number of the Fibonacci Sequence. (Related to Issue #210 for #hacktoberfest)
fibonacci.rb
implements this recursively, clearly following the mathematical definition of the Fibonacci sequence. However, as you all know, this naive implementation can be highly inefficient, and should not be executed for largen
values unless you enjoy hearing your computer's fan whir. :)fibonacci_iterative.rb
implements this iteratively, keeping track of the last two Fibonacci numbers each iteration until we reach the final result.Both programs can be run while passing an
n
value into the script, like so:But as mentioned above, fibonacci_iterative is the more efficient version. For comparison, take a look at the runtime of both versions when n = 30:
What Programming Language?
Ruby