Skip to content

scissors laurel O#48

Open
lolkinetzky wants to merge 11 commits into
Ada-C15:masterfrom
lolkinetzky:master
Open

scissors laurel O#48
lolkinetzky wants to merge 11 commits into
Ada-C15:masterfrom
lolkinetzky:master

Conversation

@lolkinetzky
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? A BST is ordered; A Heap is not entirely ordered. And heaps allow duplicates, unlike BSTs
Could you build a heap with linked nodes? You could, yes
Why is adding a node to a heap an O(log n) operation? Because it has to figure out where it truly belongs
Were the heap_up & heap_down methods useful? Why? Because after big changes, they help every node and child find where to go. They restore balance to the heap.

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

👍

Comment thread heaps/min_heap.py
Comment on lines 19 to 24
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)? O(log 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.

👍 Correct space complexity is O(log n)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

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

thank you.

Comment thread heaps/min_heap.py
Comment on lines 32 to 37
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)
"""
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 Caboose? 😆

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

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

something like a tail?

Comment thread heaps/min_heap.py
Comment on lines 65 to 72
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(log 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.

👍

Comment thread heaps/min_heap.py
Comment on lines 83 to 87
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.
"""
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

👍 I wouldn't name a variable poncho here.

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

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

WOW, I agree. I am sorry about that. I think I had Willie Nelson's cover of TVZ stuck in my head and was pretty sleepy. (1) I have no business naming anything anything near that (2) I didn't even spell pancho right.

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