Skip to content

C15 - Hena#27

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

C15 - Hena#27
hena-lee wants to merge 1 commit into
Ada-C15:masterfrom
hena-lee:master

Conversation

@hena-lee
Copy link
Copy Markdown

@hena-lee hena-lee commented Jan 4, 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
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 Hena, you hit the learning goals here. Well done. I did leave a few comments on time/space complexity.

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: ?
Time Complexity: O(log n)
Space Complexity: O(n)
"""
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 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)

Comment thread heaps/min_heap.py
@@ -21,21 +21,33 @@ def __init__(self):
def add(self, key, value = None):
Copy link
Copy Markdown

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

Comment thread heaps/min_heap.py
node_index = len(self.store) - 1
self.heap_up(node_index)

def remove(self):
Copy link
Copy Markdown

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)

Comment thread heaps/min_heap.py
self.swap(parent_index, index)
self.heap_up(parent_index)

def heap_down(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.

👍

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