-
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 - Emily V #36
base: master
Are you sure you want to change the base?
Leaves - Emily V #36
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,49 +1,67 @@ | ||||||
# Authoring recursive algorithms. Add comments including time and space complexity for each method. | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
# Time complexity: O(n) | ||||||
# Space complexity: O(n) | ||||||
def factorial(n) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
raise ArgumentError if n < 0 | ||||||
return 1 if n == 0 | ||||||
return n * factorial(n - 1) | ||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
def reverse(s) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
# Time complexity: O(n), where n is the length of the string | ||||||
# Space complexity: O(n), where n is the length of the string | ||||||
def reverse(s, pointer = s.length - 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. 👍 |
||||||
return s if s == "" | ||||||
return s[pointer] if pointer == 0 | ||||||
return s[pointer] + reverse(s, pointer - 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. String concatenation creates a new array and copies all the individual elements over and so is O(n) by itself. |
||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
def reverse_inplace(s) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
# Time complexity: O(n), where n is the length of the string. (More precisely, n/2) | ||||||
# Space complexity: O(n), where n is the length of the string. (More precisely, n/2) | ||||||
def reverse_inplace(s, start = 0, finish = s.length - 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.
|
||||||
return s[start] if start == finish | ||||||
return "" if start > finish | ||||||
return s[finish] + reverse_inplace(s, start + 1, finish - 1) + s[start] | ||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
# Time complexity: O(n) | ||||||
# Space complexity: O(n) | ||||||
def bunny(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. 👍 |
||||||
raise NotImplementedError, "Method not implemented" | ||||||
return 0 if n < 1 | ||||||
return 2 if n == 1 | ||||||
return 2 + bunny(n - 1) | ||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
def nested(s) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
# Time complexity: O(n), where n is the length of the string | ||||||
# Space complexity: O(n), where n is the length of the string | ||||||
def nested(s, parens_counter = 0, pointer = 0) | ||||||
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. 👍 |
||||||
return false if parens_counter < 0 | ||||||
return true if pointer == s.length && parens_counter == 0 | ||||||
return false if pointer == s.length && parens_counter != 0 | ||||||
return nested(s, parens_counter + 1, pointer + 1) if s[pointer] == "(" | ||||||
return nested(s, parens_counter - 1, pointer + 1) if s[pointer] == ")" | ||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
def search(array, value) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
# Time complexity: O(n), where n is the length of the string | ||||||
# Space complexity: O(n), where n is the length of the string | ||||||
def search(array, value, pointer = 0) | ||||||
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. 👍 |
||||||
return false if pointer == array.length | ||||||
return true if array[pointer] == value | ||||||
return search(array, value, pointer + 1) | ||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
def is_palindrome(s) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
# Time complexity: O(n), where n is the length of the string (More precisely, n/2) | ||||||
# Space complexity: O(n), where n is the length of the string (More precisely, n/2) | ||||||
def is_palindrome(s, length = s.length, pointer = 0) | ||||||
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. 👍 |
||||||
return true if pointer > length / 2 | ||||||
return false if s[pointer] != s[length - 1 - pointer] | ||||||
return is_palindrome(s, length, pointer + 1) if s[pointer] == s[length - 1 - pointer] | ||||||
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. You shouldn't need the if here.
Suggested change
|
||||||
end | ||||||
|
||||||
# Time complexity: ? | ||||||
# Space complexity: ? | ||||||
def digit_match(n, m) | ||||||
raise NotImplementedError, "Method not implemented" | ||||||
# Time complexity: O(n), where n is the length of the shorter string | ||||||
# Space complexity: O(n), where n is the length of the shorter string | ||||||
def digit_match(n, m, pointer = -1, matches = 0) | ||||||
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. 👍 Clever! |
||||||
return matches if (pointer).abs > n.to_s.length || (pointer).abs > m.to_s.length | ||||||
return digit_match(n, m, pointer - 1, matches + 1) if n.to_s[pointer] == m.to_s[pointer] | ||||||
return digit_match(n, m, pointer - 1, matches) if n.to_s[pointer] != m.to_s[pointer] | ||||||
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.
👍