Skip to content

C15 - Katrina K#24

Open
SterlingSunshine wants to merge 1 commit into
Ada-C15:masterfrom
SterlingSunshine:master
Open

C15 - Katrina K#24
SterlingSunshine wants to merge 1 commit into
Ada-C15:masterfrom
SterlingSunshine:master

Conversation

@SterlingSunshine
Copy link
Copy Markdown

Heaps Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
How is a Heap different from a Binary Search Tree? Heaps are defined by min/max and every child follows that rule where BST is best when each parent is roughly halfway through the data if it's balanced.
Could you build a heap with linked nodes? It would be harder for sure but I haven't tried. Why not?
Why is adding a node to a heap an O(log n) operation? In the worst case, the node will need to be heaped up the entire height of the tree until the tree follows the rule again
Were the heap_up & heap_down methods useful? Why? Yes, I used them recursively to reset my tree after adding or removing a node.

Copy link
Copy Markdown

@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.

Nice work Katrina, you hit the learning goals here. Well done.

Comment thread heaps/heap_sort.py
Comment on lines 3 to 7
def heap_sort(list):
""" This method uses a heap to sort an array.
Time Complexity: ?
Space Complexity: ?
"""
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 Time/space complexity?

Comment thread heaps/min_heap.py
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(1) *same space is added to the list every time but the behind the scenes buffer might be using more memory than this
"""
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 The space complexity is also log n due to the recursive call stack as you note

Comment thread heaps/min_heap.py
Comment on lines 30 to 35
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(1)
"""
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 The space complexity is also O(log n)

Comment thread heaps/min_heap.py
Comment on lines +62 to +65
if len(self.store) < 1:
return True

return False
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Suggested change
if len(self.store) < 1:
return True
return False
return len(self.store) == 0

Comment thread heaps/min_heap.py
return False


def heap_up(self, index):
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 Due to the call stack the space complexity is O(log n)

Comment thread heaps/min_heap.py
Comment on lines +96 to +97
self.heap_down((index * 2 + 2))
self.heap_down(index)
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

This works, but you do potentially end up with an extra swap. However you avoid extra complicated conditionals.

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