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 - Farah #42

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

Branches - Farah #42

wants to merge 3 commits into from

Conversation

in-formation
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.

Comment on lines +21 to +23
new_solution = first_solution + second_solution
second_solution = first_solution
first_solution = new_solution

Choose a reason for hiding this comment

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

Nice!

# Time Complexity - ?
# Space Complexity - ? (should be O(n))
# Time Complexity - O(n) where n integer passed through fibonacci(n) method
# Space Complexity - ? (should be O(n)); It is O(n) where n is the number of times the method is called and placed on the stack
# Hint, you may want a recursive helper method
def fibonacci(n)

Choose a reason for hiding this comment

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

👍

# Time Complexity - ?
# Space Complexity - ?
# Time Complexity - O(n) where n is equal to the number of digits in the n-number passed in the method
# Space Complexity - O(n) where n is equal to the number of times the super_digit method is placed on the call stack
def super_digit(n)

Choose a reason for hiding this comment

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

👍

# Time Complexity - ?
# Space Complexity - ?
# Time Complexity - O(n) where n is equal to the number of digits in the n-number passed in the super_digit method or the number of digits in the result-number passed in the super_digit method.
# Space Complexity - O(n) where n is equal to the number of times the suger_digit method is placed on the call stack
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.

👍 Nice work!

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