Alex - Time #30

codesrobertson · 2020-10-14T06:41:43Z

Heaps Practice

Congratulations! You're submitting your assignment!

Question	Answer
How is a Heap different from a Binary Search Tree?	A heap differs from a BST in that children nodes need to be smaller than parent nodes.
Could you build a heap with linked nodes?	Yes, but it's less optimal than using an array.
Why is adding a node to a heap an O(log n) operation?	Because a heap has log n levels.
Were the `heap_up` & `heap_down` methods useful? Why?	The heap_up and heap_down methods were useful because they enabled moving up or down the heap while maintaining order.

CheezItMan

Nice work Alex, this is very well done. Thanks again for reminding me.

CheezItMan · 2020-12-09T17:08:30Z

lib/heap_sort.rb

+# Time Complexity:  O(n log n)
+# Space Complexity: O(n)
+def heap_sort(list)


CheezItMan · 2020-12-09T17:08:43Z

lib/min_heap.rb

+  # Time Complexity: O(log n)
+  # Space Complexity: O(log n)
  def remove()


CheezItMan · 2020-12-09T17:08:50Z

lib/min_heap.rb

+  # Time complexity: O(1)
+  # Space complexity: O(1)
  def empty?


CheezItMan · 2020-12-09T17:08:59Z

lib/min_heap.rb

+  # Time complexity: O(log n)
+  # Space complexity: O(log n)
  def heap_up(index)


CheezItMan · 2020-12-09T17:09:10Z

lib/min_heap.rb

  end

-  # This helper method takes an index and 
-  #  moves it up the heap if it's smaller
-  #  than it's parent node.
  def heap_down(index)


CheezItMan · 2020-12-09T17:09:22Z

lib/min_heap.rb

  end

-  # If you want a swap method... you're welcome
+  # Thank you, Chris


Adds heap_sort and min_heap methods.

76c1cf6

codesrobertson changed the title ~~Adds heap_sort and min_heap methods.~~ Alex - Time Oct 14, 2020

CheezItMan reviewed Dec 9, 2020

View reviewed changes