Water - Li #12
Open
Water - Li #12
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
May 1, 2021
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Well done Li, you hit the learning goals here. Nice work!
Comment on lines
+4
to
+6
| # Time Complexity: O(nlogn): add O(nlogn) + remove O(nlogn) | ||
| # Space Complexity: O(n) for creating @store to store all the nodes | ||
| def heapsort(list) |
Comment on lines
+17
to
19
| # Time Complexity: O(log n): push O(1) + heap_up O(log n) | ||
| # Space Complexity: O(log n) : heap_up O(log n) | ||
| def add(key, value = key) |
Comment on lines
+26
to
28
| # Time Complexity: O(log n): pop, swap O(1) + heap_down O(log n) | ||
| # Space Complexity: O(log n) from heap_down call stacks | ||
| def remove() |
Comment on lines
+54
to
56
| # Time complexity: O(1) | ||
| # Space complexity: O(1) | ||
| def empty? |
Comment on lines
+65
to
68
| # Time complexity: O(log n): swap - O(1), and we will do it up to O(log n) times | ||
| # Space complexity: O(log n) for call stacks | ||
| # min heap, the smallest node goes up to root | ||
| def heap_up(index) |
Comment on lines
+81
to
84
| # swap parent with the smaller child | ||
| # Time complexity: O(log n): find_smaller_childs_index - O(1), swap - O(1), and we will do it up to O(log n) times | ||
| # Space complexity: O(log n) for call stacks | ||
| 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?