Space - Jessica #16
Open
Space - Jessica #16
Conversation
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
CheezItMan
reviewed
Sep 29, 2020
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Nice work Jessica, you hit the learning goals here. Well done.
Comment on lines
+4
to
6
| # Time Complexity: O(nlogn) - loops n times based on length of list, and then logn adding or removing | ||
| # Space Complexity: O(nlogn) | ||
| def heapsort(list) |
There was a problem hiding this comment.
👍 However your space complexity is O(n) because you add n elements into the heap.
Comment on lines
+17
to
+29
| def find_parent(index) | ||
| return (index - 1) / 2 | ||
| end | ||
|
|
||
| # helper method to find left child | ||
| def left_child(index) | ||
| return 2 * index + 1 | ||
| end | ||
|
|
||
| # helper method to find right child | ||
| def right_child(index) | ||
| return 2 * index + 2 | ||
| end |
Comment on lines
+32
to
34
| # Time Complexity: O(logn) depending on the height of the heap | ||
| # Space Complexity: O(logn) to hold the recursive stack | ||
| def add(key, value = key) |
Comment on lines
+41
to
+43
| # Time Complexity: O(logn) depending on the height of the heap | ||
| # Space Complexity: O(logn) to hold the recursive stack | ||
| def remove |
Comment on lines
+81
to
83
| # Time complexity: O(logn) | ||
| # Space complexity: O(logn) | ||
| def heap_up(index) |
Comment on lines
+105
to
+106
| if !@store[left] | ||
| smallest = right |
There was a problem hiding this comment.
Just a note, that if left is not in the array, then right is not either.
Comment on lines
93
to
96
| # This helper method takes an index and | ||
| # moves it up the heap if it's smaller | ||
| # than it's parent node. | ||
| def heap_down(index) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Heaps Practice
Congratulations! You're submitting your assignment!
Comprehension Questions
heap_up&heap_downmethods useful? Why?