Paper: Heaps Exercise#46
Open
ErikaChikere wants to merge 1 commit into
Open
Conversation
CheezItMan
reviewed
Jan 28, 2022
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Well done Erika, you hit the learning goals here. Well done.
Comment on lines
3
to
7
| def heap_sort(list): | ||
| """ This method uses a heap to sort an array. | ||
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: O(n log n) | ||
| Space Complexity: O(1) | ||
| """ |
There was a problem hiding this comment.
👍 The space complexity you have here is O(n) because you 're building a heap of n nodes.
Comment on lines
21
to
26
| def add(self, key, value = None): | ||
| """ This method adds a HeapNode instance to the heap | ||
| If value == None the new node's value should be set to key | ||
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: O(log n) | ||
| Space Complexity: O(log n) | ||
| """ |
Comment on lines
36
to
41
| def remove(self): | ||
| """ This method removes and returns an element from the heap | ||
| maintaining the heap structure | ||
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: O(log n) | ||
| Space Complexity: O(log n) | ||
| """ |
Comment on lines
62
to
66
| def empty(self): | ||
| """ This method returns true if the heap is empty | ||
| Time complexity: ? | ||
| Space complexity: ? | ||
| Time complexity: O(1) | ||
| Space complexity: O(1) | ||
| """ |
Comment on lines
69
to
75
| def heap_up(self, index): | ||
| """ This helper method takes an index and | ||
| moves it up the heap, if it is less than it's parent node. | ||
| It could be **very** helpful for the add method. | ||
| Time complexity: ? | ||
| Space complexity: ? | ||
| Time complexity: O(log n) | ||
| Space complexity: O(1) | ||
| """ |
There was a problem hiding this comment.
👍 However the space complexity is O(log n) because of the recursive call stack.
Comment on lines
85
to
89
| def heap_down(self, index): | ||
| """ This helper method takes an index and | ||
| moves it up the heap if it's smaller | ||
| than it's parent node. | ||
| """ |
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
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.
Will fill out below questions and clean up code later.
Heaps Practice
Congratulations! You're submitting your assignment!
Comprehension Questions
heap_up&heap_downmethods useful? Why?