-
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
Leaves - Julia K #40
base: master
Are you sure you want to change the base?
Leaves - Julia K #40
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.
Overall nice work, you hit the learning goals here. Well done.
current += 1 | ||
fibber = n_minus_1 | ||
n_minus_1 = n_minus_1 + n_minus_2 | ||
n_minus_2 = fibber | ||
return fib_helper(n, n_minus_2, n_minus_1, current) |
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!
# Hint, you may want a recursive helper method | ||
# Time Complexity - O(n) because it performs n operations | ||
# Space Complexity - O(n) because it makes n calls on the stack | ||
|
||
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.
👍
|
||
# Time Complexity - O log n because with each operation we are cutting the total of n by at worst 10 | ||
# Space Complexity - O log 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.
👍
No description provided.