Open
Conversation
CheezItMan
reviewed
Nov 14, 2019
CheezItMan
left a comment
There was a problem hiding this comment.
As you pointed out you didn't get them all done, but most of what you have is pretty good. We'll go over the solutions in class. Let me know what questions you have.
| # Space complexity: ? | ||
| # Time complexity: o(n) | ||
| # Space complexity: o(n) | ||
| def factorial(n) |
| if s.length <= 1 | ||
| return s | ||
| else | ||
| return s[-1] + reverse(s[0..-2]) |
There was a problem hiding this comment.
s[1..-1] creates a new array and copies all the individual elements over and so is O(n) by itself.
Comment on lines
+16
to
18
| # Time complexity: o(n^2) | ||
| # Space complexity: o(n^2) | ||
| def reverse(s) |
There was a problem hiding this comment.
Correct on the time/space complexities. Can you think of a way to do better?
| # Space complexity: ? | ||
| # Time complexity: | ||
| # Space complexity: | ||
| def reverse_inplace(s) |
|
|
||
| # Time complexity: o(n) | ||
| # Space complexity: o(n) | ||
| def bunny(n) |
|
|
||
| # Time complexity: o(n) | ||
| # Space complexity: o(n^2) | ||
| def nested(s) |
There was a problem hiding this comment.
👍 Time complexity is also O(n^2) because of s[1...-1]
Comment on lines
60
to
62
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def search(array, value) |
There was a problem hiding this comment.
👍 Big-O is O(n^2) due to the repeated creation of new arrays.
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
No description provided.