Skip to content
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 - Julia Bouvier #25

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Conversation

juliabouv
Copy link

No description provided.

Copy link

@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.

Overall nice work, you hit the learning goals here. Well done.

# Space Complexity - ? (should be O(n))
# Hint, you may want a recursive helper method
# Time Complexity - O(n)
# Space Complexity - O(n)
def fibonacci(n)

Choose a reason for hiding this comment

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

This works, but the solution keeps an array of all the fibonacci numbers from 0 to n for the entire length of the recursive calls. Instead you only need to keep the last 2 fibonacci numbers.

# Time Complexity - ?
# Space Complexity - ?
# Time Complexity - O(n)
# Space Complexity - O(n)
def super_digit(n)

Choose a reason for hiding this comment

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

👍
Your time complexity is right, if n is the number of digits.

# Time Complexity - ?
# Space Complexity - ?
# Time Complexity - Is this O(2^n) (exponential), because the method gets called twice each time?
# Space Complexity - Is this O(2^n) (exponential), because the method gets called twice each time?
def refined_super_digit(n, k)

Choose a reason for hiding this comment

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

👍

Comment on lines +18 to +19
# Time Complexity - Is this O(2^n) (exponential), because the method gets called twice each time?
# Space Complexity - Is this O(2^n) (exponential), because the method gets called twice each time?

Choose a reason for hiding this comment

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

This isn't exponential since the number of digits goes down by 1 with each iteration.

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