Skip to content

Scissors - Maria M.#31

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

Scissors - Maria M.#31
maria-im015 wants to merge 1 commit into
Ada-C15:masterfrom
maria-im015:master

Conversation

@maria-im015
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?
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.

Well done Maria, you hit the learning goals here. Well done.

Comment thread heaps/heap_sort.py
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(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.

👍 Nice work

Comment thread heaps/min_heap.py
Comment on lines +18 to +25
def get_parent(self, index):
return ((index - 1) // 2)

def get_left_child(self, index):
return ((index * 2) + 1)

def get_right_child(self, index):
return ((index * 2) + 2)
Copy link
Copy Markdown

Choose a reason for hiding this comment

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

Great helper functions

Comment thread heaps/min_heap.py
def get_right_child(self, index):
return ((index * 2) + 2)

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

👍 This is a particularly good helper

Comment thread heaps/min_heap.py
Comment on lines 38 to 43
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)
"""
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 51 to 56
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 O(log n) due to the recursive call stack.

Comment thread heaps/min_heap.py
@@ -46,10 +72,10 @@ def __str__(self):

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

👍

Comment thread heaps/min_heap.py
return len(self.store) == 0


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.

👍

Comment thread heaps/min_heap.py
self.swap(index, parent_node)
index = parent_node

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