Miroirs/TheAlgorithms-Ruby
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Ruby synced 2024-12-27 21:58:57 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update fibonacci.rb

Browse source
This commit is contained in:
Vitor Oliveira 2021-03-07 13:12:23 -08:00 committed by GitHub
parent 630def0e26
commit f3e7b55492
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
maths/fibonacci.rb
View file

@ -20,6 +20,7 @@
# Time complexity: O(1). Constant time complexity since we are using no loops or recursion # Time complexity: O(1). Constant time complexity since we are using no loops or recursion
# and the time is based on the result of performing the calculation using Binet's formula. # and the time is based on the result of performing the calculation using Binet's formula.
#
# Space complexity: O(1). The space used is the space needed to create the variable # Space complexity: O(1). The space used is the space needed to create the variable
# to store the golden ratio formula. # to store the golden ratio formula.
@ -29,16 +30,16 @@ def fibonacci(n)
end end
n = 2 n = 2
puts(fibonacci(n))
# Output: 1 # Output: 1
# Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1. # Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
puts(fibonacci(n))
n = 3 n = 3
puts(fibonacci(n))
# Output: 2 # Output: 2
# Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2. # Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
puts(fibonacci(n))
n = 4 n = 4
puts(fibonacci(n))
# Output: 3 # Output: 3
# Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3. # Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
puts(fibonacci(n))