-
Notifications
You must be signed in to change notification settings - Fork 56
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
C15 - Hena #27
base: master
Are you sure you want to change the base?
C15 - Hena #27
Conversation
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.
Nice work Hena, you hit the learning goals here. Well done. I did leave a few comments on time/space complexity.
def heap_sort(list): | ||
""" This method uses a heap to sort an array. | ||
Time Complexity: ? | ||
Space Complexity: ? | ||
Time Complexity: O(log n) | ||
Space Complexity: O(n) | ||
""" |
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.
👍 The time complexity is O(n log n) because you add n elements to a heap (n * log n) and then remove n elements from the heap O(n * log n)
@@ -21,21 +21,33 @@ def __init__(self): | |||
def add(self, key, value = None): |
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.
👍 However space complexity is O(1) since you just add 1 element to the heap and use an iterative solution
node = HeapNode(key, value) | ||
self.store.append(node) | ||
node_index = len(self.store) - 1 | ||
self.heap_up(node_index) | ||
|
||
def remove(self): |
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.
👍 However space complexity is O(log n)
|
||
while self.store[parent_index].key > self.store[index].key: | ||
self.swap(parent_index, index) | ||
self.heap_up(parent_index) | ||
|
||
def heap_down(self, index): |
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.
👍
Heaps Practice
Congratulations! You're submitting your assignment!
Comprehension Questions
heap_up
&heap_down
methods useful? Why?