forked from AdaGold/recursive-dynamic-programming
-
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
Open
Kalakalot
wants to merge
3
commits into
Ada-C12:master
Choose a base branch
from
Kalakalot:master
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Leaves - Julia K #40
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,8 +1,25 @@ | ||
# Improved Fibonacci | ||
|
||
# Time Complexity - ? | ||
# Space Complexity - ? (should be O(n)) | ||
# 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) | ||
|
||
return fib_helper(n, n_minus_2 = 0, n_minus_1 = 1, 2) | ||
end | ||
|
||
def fib_helper(n, n_minus_2, n_minus_1, current) # starting values (4, 0, 1, 2) | ||
|
||
# base cases | ||
|
||
raise ArgumentError if n < 0 | ||
return n if n == 0 || n == 1 | ||
return n_minus_1 + n_minus_2 if current == n | ||
|
||
# recursive step -- increment current and reassign n_minus_2 and n_minus_1 | ||
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) | ||
Comment on lines
+19
to
+23
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. nice! |
||
end | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,15 +1,21 @@ | ||
# Superdigit | ||
|
||
# Time Complexity - ? | ||
# Space Complexity - ? | ||
def super_digit(n) | ||
|
||
# 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 commentThe reason will be displayed to describe this comment to others. Learn more. 👍 |
||
# base case | ||
if n <= 9 | ||
return n | ||
else | ||
# recursive step -- convert number to array of integers and add them all together | ||
n_array = n.digits | ||
n = n_array.sum | ||
super_digit(n) | ||
end | ||
end | ||
|
||
|
||
# Time Complexity - ? | ||
# Space Complexity - ? | ||
def refined_super_digit(n, k) | ||
|
||
end | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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.
👍