Skip to content
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

Abigail C. - Rock #36

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Abigail C. - Rock #36

wants to merge 1 commit into from

Conversation

ChaAbby
Copy link

@ChaAbby ChaAbby commented Jan 18, 2022

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree?
Could you build a heap with linked nodes?
Why is adding a node to a heap an O(log n) operation?
Were the heap_up & heap_down methods useful? Why?

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Really well done Abigail, you hit the learning goals here.

Comment on lines 3 to +6
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)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 However the space complexity is O(n) because you are building up a heap of n nodes as the function runs.

Comment on lines +28 to +33
if value == None:
value = key

node = HeapNode(key,value)
self.store.append(node)
self.heap_up(len(self.store) -1)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Space/time complexity?

Comment on lines 35 to +46
def remove(self):
""" This method removes and returns an element from the heap
maintaining the heap structure
Time Complexity: ?
Time Complexity: O(log n)
Space Complexity: ?
"""
pass
if len(self.store) == 0:
return None

self.swap(0, len(self.store) -1)
min = self.store.pop()
self.heap_down(0)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Space complexity?

@@ -49,7 +61,7 @@ def empty(self):
Time complexity: ?
Space complexity: ?
"""
pass
return self.store == []

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

@@ -49,7 +61,7 @@ def empty(self):
Time complexity: ?
Space complexity: ?
"""
pass
return self.store == []


def heap_up(self, index):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Space/time complexity?

Comment on lines 90 to 95
def heap_down(self, index):
""" This helper method takes an index and
moves the corresponding element down the heap if it's
larger than either of its children and continues until
the heap property is reestablished.
"""

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 Nice work, very compact

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants