-
Notifications
You must be signed in to change notification settings - Fork 43
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Ports - Shamira #26
base: master
Are you sure you want to change the base?
Ports - Shamira #26
Conversation
Nice work! |
There was a problem hiding this 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?
# 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. |
There was a problem hiding this comment.
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.
@@ -5,8 +5,19 @@ | |||
# .... | |||
# e.g. 6th fibonacci number is 8 | |||
|
|||
# Time complexity: ? | |||
# Space complexity: ? | |||
# Time complexity: O(n) with n being the input. |
There was a problem hiding this comment.
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.
No description provided.