Open
Conversation
corrected big O notation for recursive solution
jadevance
reviewed
Apr 24, 2019
| # the fibonacci tree function calls base case for each branch of the tree (n-1) & (n-2), | ||
| # which grows exponentially for each subsequently higher level of the binary tree. | ||
| # Space complexity: I am not sure, but I think that it lineary because of the call stack | ||
| # required for each branch of the binary tree. |
There was a problem hiding this comment.
Nice explanations on both the iterative and recursive solutions!
| # base case | ||
| return n if n < 2 | ||
|
|
||
| return fibonacci(n-1) + fibonacci(n-2) |
There was a problem hiding this comment.
These are both great solutions and very clear to read. Good work! 👍
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Iterative and Recursive solution. Working on memoized solution.