Skip to content

Ports - Shamira#26

Open
MiraMarshall wants to merge 1 commit intoAda-C11:masterfrom
MiraMarshall:master
Open

Ports - Shamira#26
MiraMarshall wants to merge 1 commit intoAda-C11:masterfrom
MiraMarshall:master

Conversation

@MiraMarshall
Copy link
Copy Markdown

No description provided.

@ghost
Copy link
Copy Markdown

ghost commented May 10, 2019

Nice work!

Copy link
Copy Markdown

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice recursive solution. See my notes on the space and time complexities. You could get to O(1) space complexity with a loop instead of recursion. Any ideas?

Comment thread lib/fibonacci.rb
# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) with n being the input.
# Space complexity: O(1)- constant because it take the same amount of space regardless of the input.
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Space complexity is actually dependent on the number of recursive calls. Each time you make a call to fibonacci it has to save the previous call in the stack.

Comment thread lib/fibonacci.rb

# Time complexity: ?
# Space complexity: ?
# Time complexity: O(n) with n being the input.
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Actually your solution is O(2^n) in time complexity. We'll talk about this in the recursion lesson.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants