-
Notifications
You must be signed in to change notification settings - Fork 48
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
Branches - Macaria #33
base: master
Are you sure you want to change the base?
Conversation
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.
Take a look at my comments on Fibonacci. Otherwise nice work.
@@ -1,8 +1,29 @@ | |||
# Improved Fibonacci | |||
|
|||
# Time Complexity - ? | |||
# Time Complexity - o(n) | |||
# Space Complexity - ? (should be O(n)) | |||
# Hint, you may want a recursive helper method | |||
def fibonacci(n) |
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.
This works, but you're keeping the entire list of fibonacci numbers for the whole length of the recursion. Instead you should only keep the last 2 fibonacci numbers.
# Time Complexity - ? | ||
# Space Complexity - ? | ||
# Time Complexity - O(n) | ||
# Space Complexity - O(n) | ||
def super_digit(n) |
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.
👍
# Time Complexity - O(n) | ||
# Space Complexity - O(n) |
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.
Where n is the number of digits, yes.
No description provided.