-
Notifications
You must be signed in to change notification settings - Fork 29
Amy M #15
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
base: master
Are you sure you want to change the base?
Amy M #15
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,8 +1,15 @@ | ||
|
|
||
| # Time Complexity: ? | ||
| # Space Complexity: ? | ||
| # Time Complexity: O(n) | ||
| # Space Complexity: O(1) | ||
| def max_sub_array(nums) | ||
| return 0 if nums == nil | ||
|
|
||
| raise NotImplementedError, "Method not implemented yet!" | ||
| return 0 if nums == nil | ||
| current_sum = nums[0] | ||
| current_max = current_sum | ||
| i = 1 | ||
| while i < nums.length | ||
| current_sum = [current_sum + nums[i], nums[i]].max | ||
| current_max = [current_sum, current_max].max | ||
| i += 1 | ||
| end | ||
| return current_max | ||
| end | ||
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,7 +1,21 @@ | ||
|
|
||
|
|
||
| # Time complexity: ? | ||
| # Space Complexity: ? | ||
| # Time complexity: O(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. 👎 😭 |
||
| # Space Complexity: O(n) | ||
| def newman_conway(num) | ||
| raise NotImplementedError, "newman_conway isn't implemented" | ||
| end | ||
| raise ArgumentError if num == 0 | ||
| return "1" if num == 1 | ||
| result = "1 1" | ||
| n = 3 | ||
| while n <= num | ||
| conway_num = newman_recursive(n) | ||
| result += " " + conway_num.to_s | ||
| n += 1 | ||
| end | ||
| return result | ||
| end | ||
|
|
||
| def newman_recursive(n) | ||
| return 1 if n <= 2 | ||
| return newman_recursive(newman_recursive(n - 1)) + newman_recursive(n - newman_recursive(n - 1)) | ||
|
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. Take a look at the fibonacci notes in the textbook curriculum on algorithms. This is the same approach as the default recursive solution. Because you're not doing dynamic programming here (solving and saving subproblems for use later), you end up solving the same problems over and over again. This is actually O(33) |
||
| end | ||
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.
👍